Pagini recente » Cod sursa (job #2756304) | Cod sursa (job #934910) | Cod sursa (job #1095462) | Cod sursa (job #2963688) | Cod sursa (job #546300)
Cod sursa(job #546300)
#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 i, j, k = sqrt(n);
for (i = 2; i <= k; ++i)
for (j = i * i; j <= n; j += i)
ciur[j] = 0;
int count = 0;
for (i = 2; i <= n; ++i)
if (ciur[i])
count++;// += ciur[i];
printf("%d\n", count);
}