Cod sursa(job #222990)
| Utilizator | Data | 26 noiembrie 2008 16:27:43 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <cstdio>
#include <bitset>
using namespace std;
#define nmax 2000001
int N;
bitset <nmax> a;
int main ()
{
freopen ("ciur.in", "r", stdin);
freopen ("ciur.out", "w", stdout);
scanf ("%d", &N);
int i, nr=1;
for (i=1; i*(i+1)<=N/2; ++i)
if (!a[i])
{
nr++;
for (int j=2*i+1; j*(2*i+1)<=N; j+=2)
a[(j*(2*i+1)-1)/2] = 1;
}
for (; 2*i+1<=N; ++i)
if (!a[i]) nr++;
printf ("\n%d\n", nr);
return 0;
}
