Pagini recente » Cod sursa (job #616476) | Cod sursa (job #535970) | Cod sursa (job #1707259) | Cod sursa (job #1689696) | Cod sursa (job #3357750)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
const int MAX_N = 1000001;
bool v[MAX_N];
int main()
{
int n;
in >> n;
v[0] = v[1] = true;
for (int i = 2; i * i <= n; i++)
{
if (!v[i])
{
for (int j = i * i; j <= n; j += i)
v[j] = true;
}
}
int c = 0;
for (int i = 2; i <= n; i++)
if (!v[i])
c++;
out << c;
return 0;
}