Pagini recente » Cod sursa (job #2682217) | Cod sursa (job #2778193) | Cod sursa (job #2868679) | Borderou de evaluare (job #2917395) | Cod sursa (job #2687388)
#include <fstream>
#include <iostream>
const int NMAX = 2000001;
bool Sir[NMAX];
int main()
{
int N;
std::ifstream f("ciur.in");
f >> N;
f.close();
int i = 2, Prime = N - 1;
do
{
if(!Sir[i])
for(int j = i * i; j <= N; j += i)
if(!Sir[j])
{
Prime--;
Sir[j] = true;
}
i++;
} while(i * i <= N);
std::ofstream g("ciur.out");
g << Prime;
return 0;
}