Cod sursa(job #374006)
Utilizator | Data | 15 decembrie 2009 18:09:54 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<stdio.h>
bool prim[2000000];
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
int N,i,j,nr=0;
scanf("%d",&N);
prim[1]=1;
for(i=2;i<=N;i++)
if(prim[i]==0)
{
nr++;
for(j=2*i;j<=N;j=j+i)
prim[j]=1;
}
printf("%d",nr);
return 0;
}