Pagini recente » Cod sursa (job #368303) | Cod sursa (job #2947927) | Cod sursa (job #3290499) | Cod sursa (job #3167472) | Cod sursa (job #2926245)
#include <iostream>
#include <fstream>
using namespace std;
int main() {
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int a[2000000], n;
fin >> n;
for (int i = 2; i <= 2000000; ++i) {
a[i] = 0;
}
for (int i = 2; i * i <= n; ++i) {
int ok = 0;
if (i % 2 == 0 && i != 2 || i % 3 == 0 && i != 3) {
++ok;
}
if (ok == 0) {
for (int j = i; j * i <= n; ++j) {
a[i * j] = 1;
}
}
}
int counter = 0;
for (int i = 2; i <= n; ++i) {
if (a[i] == 0) {
++counter;
}
}
fout << counter;
}