Pagini recente » Cod sursa (job #1286244) | Cod sursa (job #1646006) | Cod sursa (job #1762093) | Cod sursa (job #3161552) | Cod sursa (job #2641164)
//#include "pch.h"
#include <iostream>
#include <vector>
#include <fstream>
#include <algorithm>
#define nmax 2000005
using namespace std;
ifstream f("ciur.in");
ofstream o("ciur.out");
bool v[nmax];
int n;
int cite;
void ciur()
{
for (size_t i = 2; i <= n; i++)
{
if (v[i] == false)
{
cite++;
for (size_t j = 2 * i; j <= n; j += i)
{
v[j] = true;
}
}
}
}
int main()
{
f >> n;
ciur();
o << cite;
}