Pagini recente » Cod sursa (job #165965) | Cod sursa (job #1535945) | Cod sursa (job #1148424) | Cod sursa (job #996643) | Cod sursa (job #2683087)
#include <iostream>
#include <fstream>
using namespace std;
bool v[2000001];
int counter;
int main() {
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n;
fin >> n;
v[0] = v[1] = true;
for (int i = 4; i <= n; i += 2) {
v[i] = true;
}
for (int i = 3; i * i <= n; i += 2) {
if(!v[i]) {
for (int j = i * i; j <= n; j = j + 2 * i) {
v[j] = true;
}
}
}
for (int i = 1; i <= n; ++i) {
if (!v[i])
++counter;;
}
fout << counter;
return 0;
}