Cod sursa(job #2542394)
| Utilizator | Data | 9 februarie 2020 21:30:54 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include<fstream>
#include<vector>
#define NMAX 2000005
//in-out
std::ifstream f("ciur.in");
std::ofstream g("ciur.out");
//data
std::vector<bool>primes(NMAX);
int n, count = 0;
//read data
void readData(){
f >> n;
}
//solve
void ciur(){
count = 1;
for(int i = 3; i<=n; i+= 2){
if(!primes[i]){
count ++;
for(int j = i; j<=n; j+=2*i){
primes[j] = true;
}
}
}
}
int main(){
readData();
ciur();
g << count << '\n';
return 0;
}