Pagini recente » Cod sursa (job #16409) | Cod sursa (job #2549891) | Cod sursa (job #267570) | Cod sursa (job #919319) | Cod sursa (job #2841065)
#include <fstream>
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const string name = ("ciur");
ifstream fin(name + ".in");
ofstream fout(name + ".out");
vector <int> v;
bool ciur[2000005];
int n;
void Eratosthenes(int n)
{
ciur[0] = ciur[1] = 1;
for (int i = 4; i <= n; i += 2) ciur[i] = 1;
for (int i = 3; i * i <= n; i += 2) {
for (int j = i * i; j <= n; j += i)
ciur[j] = 1;
}
for (int i = 2; i <= n; i++)
{
if (ciur[i] == 0) v.push_back(i);
}
}
int main()
{
fin >> n;
Eratosthenes(n);
fout << v.size();
}