Pagini recente » Cod sursa (job #2946771) | Cod sursa (job #570004) | Rating Nicu Florin (Nicu19199) | Cod sursa (job #2039512) | Cod sursa (job #1992518)
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
const int N = 2e6+10;
bool x[N];
int n, ossz;
int main()
{
cin >> n;
int gyok = sqrt(n);
x[0] = x[1] = 1;
for(int i = 4; i <= n; i += 2)
x[i] = 1;
for(int j = 3; j <= gyok; j += 2)
{
if(!x[j])
{
for(int i = 3*j; i <= n; i += (2 * j))
{
x[i] = 1;
}
}
}
for(int i = 0; i <= n; ++i)
{
if(x[i] == 0)
{
++ossz;
}
}
cout << "\n" << ossz;
return 0;
}