Cod sursa(job #1157676)
Utilizator | Data | 28 martie 2014 18:38:36 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <cstdio>
int n,numar;
int a[2000010];
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
for(int i=2;i<=n;i++)
a[i]=1;
for(int i=2;i<=n;i++)
{
if(a[i])
{
for(int j=2*i;j<=n;j=j+i)
{
a[j]=0;
}
numar++;
}
}
printf("%d\n",numar);
return 0;
}