Pagini recente » Cod sursa (job #2816194) | Cod sursa (job #1880479) | Borderou de evaluare (job #1116528) | Cod sursa (job #2282593) | Cod sursa (job #2450047)
#include <iostream>
#include <cmath>
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
bool ciur[2000000];
int main() {
int n, cnt = 0;
fin >> n;
for (i = 2; i <= n; ++i)
ciur[i] = true;
for (i = 2; i <= n; ++i)
if (ciur[i])
{
++cnt;
for (int j = i + i; j <= n; j += i)
prim[j] = 0;
}
fout << cnt;
//system("pause");
return 0;
}