Cod sursa(job #3203187)
Utilizator | Matica Laurentiu-Andrei laurentiu.matica | Data | 13 februarie 2024 11:19:21 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
// #include <iostream>
#include <fstream>
using namespace std;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
int v[2000001];
int ciur(int n)
{
for (int i = 0; i <= n; i++)
v[i] = 0;
v[0] = 1;
v[1] = 1;
int nr = 0;
for (int i = 2; i <= n; i++)
if (!v[i])
{
nr++;
for (int j = 2 * i; j <= n; j += i)
v[j] = 1;
}
return nr;
}
int main()
{
int n;
cin >> n;
cout << ciur(n);
return 0;
}