Pagini recente » Cod sursa (job #170194) | Cod sursa (job #387012) | Cod sursa (job #699361) | Cod sursa (job #659722) | Cod sursa (job #546303)
Cod sursa(job #546303)
#include <cstdio>
#include <cmath>
#include <vector>
using namespace std;
vector<bool> ciur;
int n;
int main() {
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
scanf("%d", &n);
ciur.resize(n + 5, 1);
int k = sqrt(n);
for (int i = 2; i <= k; ++i)
if (ciur[i])
for (int j = i * i; j <= n; j += i)
ciur[j] = 0;
int count = 0;
for (int i = 2; i <= n; ++i)
count += ciur[i];
printf("%d\n", count);
}