Pagini recente » Cod sursa (job #2126426) | Cod sursa (job #529352) | Cod sursa (job #2708993) | Cod sursa (job #807042) | Cod sursa (job #2662900)
#include <iostream>
#include <cstdio>
using namespace std;
const int NMAX = 2000000;
bool ciur[NMAX + 5];
int main() {
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
int n, ans = 1;
scanf("%d", &n);
ciur[0] = ciur[1] = true;
for(int i = 4; i <= n; i += 2) ciur[i] = true;
int i = 3;
while(i <= n) {
if(!ciur[i]) {
ans++;
for(int j = 2 * i; j <= n; j += i)
ciur[j] = true;
}
i += 2;
}
printf("%d", ans);
return 0;
}