Cod sursa(job #397045)
Utilizator | Data | 16 februarie 2010 11:47:03 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.27 kb |
#include<iostream.h>
int v[2000001],i,c,n,j;
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
for(i=2;i<=n;i++)
if(!v[i])
{
v[i]=1;
c++;
for(j=2*i;j<=n;j+=i)
v[j]=1;
}
printf("%d",c);
return 0;
}