Cod sursa(job #2102571)
| Utilizator | Data | 9 ianuarie 2018 00:21:00 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.68 kb |
#include <cstdio>
using namespace std;
int N, p = 1, v[(2000000 >> 6) + 10];
int main()
{
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
scanf("%d", &N);
for(int i = 1; ((i * i) << 1) + (i << 1) <= N; i += 1)
{
if(!(v[i >> 5] & (1 << (i & 31))))
{
for(int j = ((i * i) << 1) + (i << 1); (j << 1) + 1 <= N; j += (i << 1) + 1)
{
v[j >> 5] |= (1 << (j & 31));
}
}
}
for(int i = 1; 2 * i + 1 <= N; ++i)
{
if(!(v[i >> 5] & (1 << (i & 31))))
{
++p;
}
}
printf("%d", p);
return 0;
}
