Cod sursa(job #2969596)
| Utilizator | Data | 23 ianuarie 2023 14:28:26 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
std::freopen("ciur.in" , "r", stdin);
std::freopen("ciur.out" , "w", stdout);
ll size;
cin >> size;
bool ciur[size] = {};
ciur[0] = ciur[1] = true;
ll rs = 0;
for(ll i = 2 ; i < size; i++){
if(ciur[i] == false){
rs++;
for(ll j = i * 2; j < size; j+= i){
ciur[j] = true;
}
}
}
cout << rs;
return 0;
}
