Cod sursa(job #1016443)
Utilizator | Data | 26 octombrie 2013 11:43:34 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <stdio.h>
int prim[2000005];
int main()
{
int i,n,count=0;
FILE *f=fopen("ciur.in","r");
FILE *g=fopen("ciur.out","w");
fscanf(f,"%d",&n);
for(i=1;i<=n;i++)
{
prim[i]=1;
}
for (i=2;i<=n;i++)
{
if (prim[i])
{
int j;
for (j=2*i;j<=n;j+=i)
{
prim[j]=0;
}
count++;
}
}
fprintf(g,"%d",count);
fclose(f);fclose(g);
return 0;
}