Pagini recente » Borderou de evaluare (job #3039337) | Istoria paginii runda/baraj2_cnshb | Borderou de evaluare (job #1684246) | Borderou de evaluare (job #2959768) | Cod sursa (job #2834424)
#include <bits/stdc++.h>
#define MAX_N 2000000
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main()
{
int n, contor = 0;
fin >> n;
bitset<MAX_N + 1> ciur;
ciur[0] = 1;
ciur[1] = 1;
for (int i = 2; i <= n; i++)
if (!ciur[i])
{
contor++;
for (int j = i * 2; j <= n; j += i)
ciur[j] = 1;
}
fout << contor;
return 0;
}