Cod sursa(job #632864)
Utilizator | Data | 12 noiembrie 2011 14:24:25 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <cstdio>
#include <bitset>
using namespace std;
bitset <2000001> v;
int N,cnt;
int main ()
{
freopen ("ciur.in","r",stdin);
freopen ("ciur.out","w",stdout);
scanf ("%d",&N);
for (int i=2; i<=N; ++i)
if (!v[i])
{
++cnt;
for (int j=i+i; j<=N; j+=i)
v[j]=1;
}
printf ("%d",cnt);
return 0;
}