Cod sursa(job #264153)
Utilizator | Ciurel Victor CiurelVictor | Data | 21 februarie 2009 16:30:25 |
---|---|---|---|
Problema | Factorial | Scor | 0 |
Compilator | c | Status | done |
Runda | Arhiva de probleme | Marime | 0.48 kb |
#include <iostream.h>
#include <conio.h>
void main()
{
int b[100],m=0,a[100],max=0,n,k,i,r,d;
cout<<"n="; cin>>n;
for (i=1; i<=n; i++)
{ cout<<"a["<<i<<"]="; cin>>a[i]; }
for (i=1; i<=n; i++)
{
r=a[i]; d=2; k=0;
while (r!=1)
{
if (r%d==0)
{
k++;
while (r%d==0)
r=r/d;
}
d++;
}
if (k>=max)
{ m++;
b[m]=a[i];
max=k;
}
}
for (i=1; i<=m; i++)
cout<<b[i]<<" ";
cout<<endl;
cout<<max;
cout<<endl;
getch();
}