Cod sursa(job #339247)
Utilizator | Data | 9 august 2009 01:01:06 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.28 kb |
#include <cstdio>
char a[2000003];
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
int i,n,sol=0;
scanf("%d",&n);
for (i=2;i<=n;++i)
if (!a[i])
{
sol++;
for (int j=2*i;j<=n;j+=i)
a[j]=1;
}
printf("%d\n",sol);
return 0;
}