Cod sursa(job #667016)
Utilizator | Data | 22 ianuarie 2012 15:33:03 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <stdio.h>
char v[2000000];
int main ()
{ int N,i,j,nr=0;
FILE *f=fopen("ciur.in","r");
FILE *g=fopen("ciur.out","w");
fscanf (f,"%d",&N);
for (i=2; i<=N; i++)
if (v[i]==0) { nr++;
for (j=2*i; j<=N; j+=i)
v[j]=1;
}
fprintf(g,"%d",nr);
fclose (f);
fclose (g);
return 0;
}