Cod sursa(job #2818383)
| Utilizator | Data | 15 decembrie 2021 23:01:08 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
#include <iostream>
#include <cmath>
using namespace std;
int N, s;
bool primes[2000001];
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main(){
fin >> N;
for(int i = 2; i <= N; ++i){
primes[i] = 1;
}
for(int i = 2; i <= sqrt(N); ++i){
if(primes[i]){
for(int j = 2; j * i <= N; ++j){
primes[j * i] = 0;
}
}
}
for(int i = 2; i <= N; ++i){
if(primes[i]){
s++;
}
}
fout << s << "\n";
return 0;
}