Pagini recente » Borderou de evaluare (job #137029) | Cod sursa (job #2727545) | Cod sursa (job #138039) | Cod sursa (job #1647713) | Cod sursa (job #1692882)
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <bitset>
using namespace std;
main() {
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
int n;
scanf("%d", &n);
bitset<2000009> bit;
bit.set();
for (int i = 2; i <= n; i++) {
for (int j = i * i; j <= n; j += i) {
bit[j] = 0;
}
}
printf("%d\n", bit.count() - bit.size() + n - 1);
}