Pagini recente » Cod sursa (job #572234) | Cod sursa (job #3170750) | Cod sursa (job #2268993) | Cod sursa (job #278945) | Cod sursa (job #2048505)
#include <bits/stdc++.h>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
const int MAXSIZE = 100000000/2/8+1;
char p[MAXSIZE];
int ciur(int n) {
int i, j, nr = 1;
for (i = 1; ((i * i) << 1) + (i << 1) <= n; i += 1) {
if ((p[i >> 3] & (1 << (i & 7))) == 0) {
for (j = ((i * i) << 1) + (i << 1); (j << 1) + 1 <= n; j += (i << 1) + 1) {
p[j >> 3] |= (1 << (j & 7));
}
}
}
for (i = 1; 2 * i + 1 <= n; ++i)
if ((p[i >> 3] & (1 << (i & 7))) == 0)
nr++;
return nr;
}
int main()
{
long long n;
in>>n;
out<<ciur(n);
return 0;
}