Cod sursa(job #2969612)
Utilizator | Data | 23 ianuarie 2023 14:33:31 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e6 + 9;
bool ciur [maxn];
freopen("ciur.in" , "r", stdin);
freopen("ciur.out" , "w", stdout);
int main(){
ciur[0] = ciur[1] = true;
int rs = 0;
for(inti = 2; i < maxn; i++){
if(ciur[i] == false){
rs++;
for(intj = i * 2; j < maxn; j+=i){
ciur[j] = true;
}
}
}
cout << rs;
return 0;
}