Pagini recente » Cod sursa (job #1433111) | Cod sursa (job #2754801) | Cod sursa (job #1264783) | Cod sursa (job #2089998) | Cod sursa (job #3193099)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
bool prim[2000000];
ifstream in("ciur.in");
ofstream out("ciur.out");
int n;
in >> n;
for (int i = 2; i * i <= n; i++)
{
if (prim[i] == 0)
{
for (int j = 2 * i; j <= n; j += i)
{
prim[j] = 1;
}
}
}
int ossz = 0;
for (int i = 2; i <= n; i++)
{
if (prim[i] == 0)
{
ossz++;
}
}
out << ossz;
return 0;
}