Pagini recente » Cod sursa (job #1669349) | Cod sursa (job #109795) | Cod sursa (job #1219194) | Cod sursa (job #3003427) | Cod sursa (job #1445663)
#include <cstdio>
#include <cassert>
#include <algorithm>
#define _submit
#ifdef _submit
#define InFile "ciur.in"
#define OutFile "ciur.out"
#else
#define InFile "fis.in"
#define OutFile "fis.out"
#endif
#define MAXN 2000010
char marked[MAXN];
int ciur(int n) {
int nrPrimes = 1;
for (int i = 3; i <= n; i += 2)
if (!marked[i]) {
nrPrimes++;
for (int j = i; j <= n; j += i)
marked[j] = 1;
}
return nrPrimes;
}
int main() {
assert(freopen(InFile, "r", stdin));
assert(freopen(OutFile, "w", stdout));
int N;
scanf("%d", &N);
printf("%d\n", ciur(N));
return 0;
}