Cod sursa(job #2988282)
Utilizator | Data | 3 martie 2023 22:36:55 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<bits/stdc++.h>
using namespace std;
const int N = 2000009;
bool composite[N];
//ifstream in ("ciur.in");
//ofstream out("ciur.out");
auto& in = cin;
auto& out = cout;
int main(){
int n, count = 0;
in>>n;
for(int i=2;i<=n;i++)
if(!composite[i]) {
count++;
for(int j=2*i;j<=n;j+=i)
composite[j] = true;
}
out<<count<<endl;
return 0;
}