Cod sursa(job #3165136)
Utilizator | Data | 5 noiembrie 2023 15:10:35 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int ciur[2000009];
int main(){
int nr, rasp=0;
fin>>nr;
for(int i=2;i*i<=nr;i++){
for(int m=2*i; m<=nr; m+=i){
ciur[m]=1;
}
}
for(int i=2;i<=nr;i++){
if(ciur[i]==0)
rasp++;
//fout<<ciur[i]<<' ';
}
fout<<rasp;
return 0;
}