Cod sursa(job #2869645)
| Utilizator | Data | 11 martie 2022 18:38:05 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
#include <vector>
using namespace std;
#define ll long long
ifstream fin("ciur.in");
ofstream fout("ciur.out");
ll ciur(ll n){
ll nr = 0;
vector <bool> prim(n+1, false);
prim[1] = true;
for(ll i = 2; i <= n; ++i){
if(!prim[i]) {
++nr;
for(ll j = i; j <= n; j+=i)
prim[j] = true;
}
}
return nr;
}
int main(){
ll n;
fin >> n;
fout << ciur(n);
return 0;
}