Pagini recente » Cod sursa (job #9802) | Cod sursa (job #2951486) | Cod sursa (job #2719159) | Cod sursa (job #3157836) | Cod sursa (job #1380684)
#include <iostream>
#include <vector>
#include <fstream>
#include <cmath>
std::ifstream fin ("ciur.in");
std::ofstream fout("ciur.out");
int main() {
int N;
fin >> N;
std::vector<bool> v(N + 1, true);
int sqrtN = sqrt(N);
for (int i = 2; i <= sqrtN; ++i) {
for (int j = i * i; j <= N; j += i) {
v[j] = false;
}
}
int primCount = 0;
for (int i = 2; i <= N; ++i)
if (v[i] == true)
++primCount;
fout << primCount << std::endl;
return 0;
}