Cod sursa(job #2861796)
Utilizator | Popa Robert robbertt | Data | 4 martie 2022 14:31:11 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.6 kb |
//#include <iostream>
#include <vector>
#include <string.h>
#include <fstream>
using namespace std;
vector <int> primes;
ifstream cin ("ciur.in");
ofstream cout("ciur.out");
void check_primes(int n){
vector <int> pr(2000000);
for(int i = 2; i <= n; ++i){
if(pr[i] == 0){
for(int j = i+i; j <= n; j += i)
pr[j] = 1;
primes.push_back(i);
}
}
}
int main(){
int n;
cin >> n;
check_primes(n);
for(auto i : primes)
cout << i << ' ';
cout << '\n';
cout << primes.size();
return 0;
}