You are on page 1of 1

#include <iostream>

using namespace std;

int numar_divizori(int x) //numar divizorii


{
int d, contor = 0;
for (d=1 ; d <= x/ 2; d++)
if (x % d == 0)
contor++;
return contor+1;//am pus contor+1 pt ca for-ul merge pana la x/2 si nu pana la x
}

void citire(int n, int v[50])//citire vector


{int i;
for(i=0;i<n;i++)
{cout<<"v["<<i<<"]";
cin>>v[i]; }
}

int main(void)
{
int v[50], n, i,maxi=0, aux;
cout << "n="; cin >> n;
citire(n,v);
for (i=0 ; i < n ; i++)
{
cout << numar_divizori(v[i]) << ","; //afiseaza nr de divizori
if(maxi<numar_divizori(v[i]) ) //algoritm pt maxim
maxi=numar_divizori(v[i]);}
cout<<"maxi="<<maxi;
return 0;
}

//* Exemplu:
n=4
v[0]=20; v[1]=6; v[2]=3; v[3]=4;
6,4,2,3, maxi=6 *//

You might also like