Cod sursa(job #631781)

Utilizator StefanLacheStefan Lache StefanLache Data 9 noiembrie 2011 19:06:45
Problema Ciurul lui Eratosthenes Scor 60
Compilator cpp Status done
Runda Arhiva educationala Marime 0.38 kb
#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;
}