Pagini recente » Cod sursa (job #164737) | Cod sursa (job #2773941) | Cod sursa (job #2852429) | Cod sursa (job #1059169) | Cod sursa (job #2936281)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main() {
int n;
short a[2000000];
fin >> n;
for (int i = 2; i * i <= n; ++i) {
int ok = 0;
if (i % 2 == 0 && i != 2 || i % 3 == 0 && i != 3 || i % 7 == 0 && i != 7 || i % 5 == 0 && i != 5) {
++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;
return 0;
}