Cod sursa(job #3137262)
| Utilizator | Data | 11 iunie 2023 23:22:13 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <bits/stdc++.h>
#define DIM 3000001
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bitset <DIM> prime;
int n;
int solve(int n){
int answer = 0;
for(int i=2;i<=n;i++)
if(!prime[i]){
answer++;
for(int j=2;j*i<=n;j++)
prime[i * j] = 1;
}
return answer;
}
int main(){
ios :: sync_with_stdio(false);
fin.tie(0);
fout.tie(0);
fin >> n;
fout << solve(n);
fin.close();
fout.close();
return 0;
}
