Cod sursa(job #444274)
Utilizator | Data | 19 aprilie 2010 21:21:10 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include<cstdio>
char v[2000001];long i,k,j,n;
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%ld",&n);
for(i=2;i<=n;++i)
v[i]=0;
for(i=2;i<=n;i++)
{
if(v[i]==0)k++;
for(j=2;j<=n/i;j++)
v[i*j]=1;
}
printf("%ld",k);
return 0;}