Cod sursa(job #680222)
Utilizator | Dilanyan Arman Tyler_Dylan | Data | 14 februarie 2012 23:34:59 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <stdio.h>
int N,cnt;
char prim[2000005];
int main()
{
int i,j;
FILE* f=fopen("ciur.in","r");
FILE* g=fopen("ciur.out", "w");
fscanf(f,"%d",&N);
for (i=2; i<=N; i++)
prim[i]=1;
for (i=2; i<=N; i++)
if (prim[i])
{
++cnt;
for (j=i+i; j<=N; j=j+i)
prim[j]=0;
}
fprintf(g,"%d", cnt);
fclose(f); fclose(g);
return 0;
}