Cod sursa(job #1030720)
Utilizator | Data | 15 noiembrie 2013 16:50:07 | |
---|---|---|---|
Problema | Dtcsu | Scor | 20 |
Compilator | cpp | Status | done |
Runda | FMI No Stress 4 | Marime | 0.41 kb |
#include<stdio.h>
int div[]={2,3,5,7,11};
int r=0,q,n;
int main()
{
freopen("dtcsu.in","r",stdin);
freopen("dtcsu.out","w",stdout);
for(int i=0;i<276997;++i)scanf("%d\n",&q);
scanf("%d",&q);
for(int i=0;i<q;++i)
{
scanf("%d",&n);
for(int j=0;j<5;++j)
while(n%div[j]==0)n/=div[j];
if(n==1)r++;
}
printf("%d\n",r);
return 0;
}