Pagini recente » Borderou de evaluare (job #2199488) | Cod sursa (job #2263856) | Istoria paginii algoritmiada-2010/runda-1/solutii/studenti | Borderou de evaluare (job #1743391) | Cod sursa (job #2606542)
#include <iostream>
#include <fstream>
#include <cassert>
#include <bitset>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bitset<2000005> prim;
int n;
int main()
{
f >> n;
int nr = 0;
prim.flip();
for (long long i = 2;i <= n;i++)
{
if (prim[i])
{
for (long long j = i * i;j <= n;j += i)
prim[j] = false;
nr++;
}
}
g << nr;
f.close();
g.close();
return 0;
}