Pagini recente » Cod sursa (job #1555172) | Borderou de evaluare (job #832007) | Cod sursa (job #546134) | Cod sursa (job #2635018) | Cod sursa (job #2499959)
#include <cstdio>
#include <bitset>
using namespace std;
const int NMAX = 2000505;
bitset<NMAX> mark;
int N;
int main() {
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
scanf("%d", &N);
for (int i = 2; i <= N; i++) {
if (!mark[i]) {
for (int j = 2 * i; j <= N; j += i) {
mark[j] = 1;
}
}
}
printf("%d\n", N - 1 - mark.count());
return 0;
}