Cod sursa(job #2428298)
| Utilizator | Data | 4 iunie 2019 17:03:28 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <cstdio>
#include <algorithm>
#include <bitset>
#define Nmax 2000002
using namespace std;
int N;
bitset <Nmax> b;
void read()
{
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
scanf("%d", &N);
}
void ciur()
{
int i, j;
for(i = 3; i * i <= N; i += 2)
if(!b[i]) for(j = i * i; j <= N; j += 2 * i)
b[j] = 1;
}
void write()
{
printf("%d\n", (N + 1) / 2 - b.count());
}
int main()
{
read();
ciur();
write();
return 0;
}
