Cod sursa(job #1777687)
Utilizator | Data | 12 octombrie 2016 20:02:36 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <stdio.h>
using namespace std;
int cnt, N, d, i;
char prim[2000005];
int main()
{
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
scanf ("%d", &N);
for (d=2; d<=N; d++)
prim[d]=0;
for (d=2; d*d<=N; d++)
if (prim[d])
{
cnt++;
for (i=d*d; i<=N; i+=d)
prim [i]=0;
}
printf ("%d", &cnt);
return 0;
}