Pagini recente » Istoria paginii runda/simulareoji18/clasament | Cod sursa (job #1848475) | Cod sursa (job #2646288) | Cod sursa (job #3263375) | Cod sursa (job #187627)
Cod sursa(job #187627)
#include <cstdio>
#include <bitset>
#define MAX_N 2000001
using namespace std;
int N;
void ciur()
{
int cnt = 1, M = (N - 1) >> 1;
bitset<(MAX_N >> 1)> V;
for(int i = 3; i<= N; i += 2)
{
if(V[i >> 1]) continue;
for(int j = i + (i >> 1); j <= M; j += i)
V[j] = 1;
++ cnt;
}
printf("%d\n",cnt);
}
int main()
{
freopen("ciur.in","rt",stdin);
freopen("ciur.out","wt",stdout);
scanf("%d",&N);
ciur();
}