Cod sursa(job #2427976)
Utilizator | Data | 3 iunie 2019 10:51:39 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <bits/stdc++.h>
using namespace std;
bool ciur[2000005];
int nr,n;
ifstream in("ciur.in");
ofstream out("ciur.out");
int main()
{
in>>n;
for (int i = 2; i * i <= n;++i)
if (ciur[i] == false)
for (int j = i * i;j <= n;j += i)
ciur[j] = true;
for (int i = 2;i <= n;++i)
nr += (ciur[i] == false);
out<<nr;
return 0;
}