Cod sursa(job #427415)
Utilizator | Data | 27 martie 2010 20:55:26 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
# include <algorithm>
using namespace std;
int n,k;
char a[2000005];
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d", &n);
fill(a+2,a+n+2,1);
for (int i=2;i<=n;i++)
if (a[i])
{
k++;
for (int j=2*i;j<=n;j+=i)
a[j]=0;
}
printf("%d", k);
return 0;
}