Cod sursa(job #3287786)
Utilizator | Data | 19 martie 2025 12:57:02 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <vector>
#define MAXN 2000000
using namespace std;
vector<int> prime(2000000, true);
void seive(int n){
for(int i = 2; i<=n; i++){
if(prime[i]){
for(int j = i*i; j<=n; j+=i){
prime[j] = false;
}
}
}
}
int main(){
ifstream fin("ciur.in"); ofstream fout("ciur.out");
int n;
fin >> n;
seive(n);
int k = 0;
for(int i = 2; i<=n; i++){
if(prime[i]) k++;;
}
cout << k << endl;
fout << k << endl;
}