Cod sursa(job #714106)
Utilizator | Cotirlea Anamaria Anamaria20 | Data | 15 martie 2012 13:36:21 |
---|---|---|---|
Problema | Suma si numarul divizorilor | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <stdio.h>
FILE *f,*s;
int v1[1000005],v2[100000];
int i,j,k,l,m,n;
int Putere(int a, int b, int c)
{
r=1;
while(b!=0)
{
if(b%2==1)
r=(r*a)%c;
a=(a*a)%c;
b=b/2;
}
return r;
}
int main()
{
f=fopen("ssnd.in","r");
s=fopen("ssnd.out","w");
fscanf(f,"%d",&m);
for(i=2;i<100000;i++)
{
if(v1[i]==0)
{
v2[++k]=i;
for(j=i+i;j<100000;j+=i)
viz[j] = 1;
}
}
for(i=1;i<=m;i++)
{
fscanf(f,"%d",&n);
}
fclose(s);
return 0;
}