Pagini recente » Cod sursa (job #2761350) | Cod sursa (job #3122001) | Cod sursa (job #1525014) | Cod sursa (job #1621206) | Cod sursa (job #2753975)
#include <iostream>
using namespace std;
int p[2000000];
int N = 0;
int NP = 0;
void elim(int a) {
int check = a*a;
while(check <= N) {
p[check-1] = 1;
check += a;
}
}
int cntp() {
int countp = 0;
for(int i = 0; i < N; i++) {
if(p[i] == 1) {
countp++;
}
}
return countp;
}
int ciur() {
int i = 1;
while(i < N) {
elim(i+1);
i++;
}
return cntp();
}
int main()
{
cin >> N;
p[0] = 1;
cout << N - ciur();
return 0;
}