Cod sursa(job #2818379)
Utilizator | Data | 15 decembrie 2021 22:51:17 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
#include <iostream>
using namespace std;
int N, s, 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 <= N; ++i){
if(primes[i]){
for(int j = 2; j * i <= N; ++j){
primes[j * i] = 0;
}
s++;
}
}
fout << s << "\n";
return 0;
}