Pagini recente » runda_ezoterica_5 | Istoria paginii runda/dedicatie_speciala8/clasament | Istoria paginii runda/oji-2015-cls11-12124151 | Istoria paginii runda/awertwtr | Cod sursa (job #2456483)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main()
{
long long unsigned n, i, j, c; c = 0;
vector <bool>A(n + 3, 1);
fin >> n;
for(i = 2; i*i <= n; ++i)
{
if(A[i] == 1)
{
for(j = 2; j <= n/i; ++j)
A[i * j] = 0;
}
}
for(i = 2; i <= n; ++i)
if(A[i] == 1)
++c;
fout << c;
return 0;
}