Cod sursa(job #626765)
Utilizator | Data | 28 octombrie 2011 10:06:00 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.28 kb |
#include<stdio.h>
int N,k,j,i;
char v[2000001];
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&N);
for( i = 2 ; i <= N ; ++i)
if(v[i]==0)
{ ++k;
for( j = i+i ; j <= N ; j += i)
v[j]=1;
}
printf("%d",k);
return 0;
}