Cod sursa(job #434881)
Utilizator | Data | 6 aprilie 2010 18:00:01 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <stdio.h>
int ciur[2000001];
long int n, i, j, k;
int nr;
int main()
{
FILE *f = fopen ("ciur.in","r");
FILE *g = fopen ("ciur.out","w");
fscanf (f,"%ld", &n);
fclose(f);
for (i=2; i<=n; ++i)
ciur[i] = 1;
for (i=2; i<=n; ++i)
if (ciur[i])
{
nr ++;
for (j=i+i; j<=n; j+=i)
ciur[j] = 0;
}
fprintf (g,"%d", nr);
fclose(g);
return 0;
}