Cod sursa(job #591365)
Utilizator | Data | 23 mai 2011 20:55:50 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include<stdio.h>
#include<iostream.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;
}