Cod sursa(job #613429)

Utilizator Theorytheo .c Theory Data 25 septembrie 2011 11:44:49
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.35 kb
Raporteaza aceasta sursa 
#include <stdio.h>

int N, cnt;
char prim[2000005];
 
int main(void)
{
int i, j;
 
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
 
scanf("%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 += i)
prim[j] = 0;
}
 
printf("%d\n", cnt);
 
return 0;
}