Cod sursa(job #3037184)
Utilizator | Data | 25 martie 2023 13:40:20 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <bits/stdc++.h>
using namespace std;
bitset<2000005> ciur;
int main(void){
ofstream cout("ciur.out");
ifstream cin("ciur.in");
int n,ans = 0;
cin >> n;
for(int i = 2;i<=n;i++){if(ciur[i] == 0){ans++; for(int j = 2;j*i<=n;j++)ciur[i * j] = 1;}}
cout << ans;
}