Cod sursa(job #3294833)
Utilizator | Data | 29 aprilie 2025 12:28:29 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include<fstream>
#include<map>
using namespace std ;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
map <int , int > fr;
int main(){
int n , cnt = 0 ;
cin>>n;
for(int i = 2 ; i <= n ; i ++ )
fr[i] = 1 ;
for(int i = 2 ; i <= n ; i ++ ){
if(fr[i] == 1 ){
cnt ++ ;
for(int j = 2 * i ; j <= n ; j +=i )
fr[j] = 0 ;
}
}
cout<<cnt;
return 0 ;
}