Cod sursa(job #2843092)
Utilizator | Data | 1 februarie 2022 22:55:07 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <bits/stdc++.h>
using namespace std;
bool ciur[2000000];
int main(void){
ofstream cout("ciur.out");
ifstream cin("ciur.in");
int n;
cin >> n;
int cnt = 0;
for(int i = 2;i<=n;i++){
if(!ciur[i]){
++cnt;
for(int j = 2;j*i<=n;j++){
ciur[i*j] = true;
}
}
}
cout << cnt;
}