Cod sursa(job #2811962)
Utilizator | Data | 3 decembrie 2021 18:16:41 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream cin ("ciur.in");
ofstream cout ("ciur.out");
int v[2000001];
int main ()
{
int n, k = 0;
cin >> n;
v[0] = v[1] = 1;
for (int i = 2; i * i <= n; ++i){
if (v[i] == 0){
for (int j = 2;j <= n/i;++j)
{
v[i*j] = 1;
}
}
}
for (int i = 2;i <=n;++i)
if (v[i] == 0)
++k;
cout << k;
return 0;
}