Pagini recente » Cod sursa (job #2632827) | Cod sursa (job #1768267) | Cod sursa (job #31385) | Cod sursa (job #1706037) | Cod sursa (job #1733225)
#include <fstream>
#define nmax 2000001
using namespace std;
int get_n (){
ifstream fin ("ciur.in");
int n;
fin >> n;
return n;
}
int solve (int n){
bool seen [nmax];
for (auto &x : seen)
x = false;
for (int i = 2; i <= n; i++)
if (!seen[i])
for (int j = i*2; j <= n; j+= i)
seen[j] = true;
int primes = 0;
for (int i = 2; i <= n; i++)
if (seen[i] == false)
primes ++;
return primes;
}
void print_data (int n){
ofstream fout ("ciur.out");
fout << solve (n);
}
int main(){
int n;
n = get_n();
print_data (n);
return 0;
}