Pagini recente » Cod sursa (job #2589366) | Cod sursa (job #1783772) | Cod sursa (job #1799202) | Monitorul de evaluare | Cod sursa (job #1651290)
#include <iostream>
#include <fstream>
//#include "definitions.h"
#define MAX_N 200000
using namespace std;
bool isPrimeNumber(int n) {
for (int i = 2; i<=n/2; i++)
if (n%i == 0) return false;
return true;
}
int countPrimes(int n) {
bool sieve[MAX_N];
int count = 0;
for (int i = 0; i<n; i++)
sieve[i] = true;
int step = 2;
count = 0;
for (int i = 2; i<n; i++) {
if (sieve[i] == true) {
for (int index = i; index < n; index+=i) {
sieve[index] = false;
}
count++;
}
}
return count;
}
int main() {
ifstream f("ciur.in");
ofstream g("ciur.out");
int n;
f>>n;
g<<countPrimes(n);
return 0;
}