Răspuns:
{
int n,i,j,a[14],nr;
a[1]=1;
a[2]=3;
a[3]=9;
a[4]=25;
a[5]=65;
a[6]=161;
a[7]=385;
a[8]=897;
a[9]=2049;
a[10]=4069;
a[11]=10241;
a[12]=22529;
a[13]=49153;
a[14]=106497;
do
{
cout<<"n=";
cin>>n;
}while(n>14);
for(i=1;i<=n;i++)
{
nr=0;
for(j=1;j<=a[i];j++)
if(a[i]%j==0)
nr++;
cout<<a[i]<<" are "<<nr<<" divizori"<<endl;
}
return 0;
}
Explicație:
Multumesc+5*+cel mai inteligent raspuns?
