Pagini recente » Borderou de evaluare (job #2783221) | Cod sursa (job #289058) | Cod sursa (job #2322554) | Cod sursa (job #2563255) | Cod sursa (job #2438249)
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
/*
int checkPrime(int x) {
for (int i = 2; i <= x / 2; i++)
if (x % i == 0)
return 0;
return 1;
}
int Ciur(int N) {
int counter = 0;
for (int i = 2; i <= N; i++) {
if (checkPrime(i))
counter++;
}
return counter;
}
int main() {
int N;
fin >> N;
fout << Ciur(N);
}
*/
int main() {
unsigned n, counter = 0;
char vec[2000001];
fin >> n;
for (int i = 2; i <= n; i++)
vec[i] = 1;
for (int i = 2; i <= n; i++) {
if (vec[i]) {
counter++;
for (int j = i + i; j <= n; j += i)
vec[j] = 0;
}
}
fout << counter;
}