Cod sursa(job #718675)
Utilizator | Data | 20 martie 2012 23:14:06 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <cstdio>
using namespace std;
int n,nr;
int a[2000001];
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
for (int i=2;i<=n;i++)
if (!a[i])
{
nr++;
for (int j=i+i;j<=n;j+=i)
a[i]=-1;
}
printf("%d",nr);
return 0;
}