Cod sursa(job #2771166)
Utilizator | Data | 25 august 2021 18:39:50 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int ciur(int n){
int c=0;
bool b[n];
memset(b, true, sizeof(b));
for (int i=2; i*i<n; ++i){
if (b[i]){
for (int j=i*i; j<n; j+=i){
b[j]=false;
}
}
}
for (int i=0; i<n; ++i){
if (!b[i]) ++c;
}
return c;
}
int main (){
ios_base::sync_with_stdio(0); cin.tie(0);
int n; f>>n;
g<<ciur(n);
return 0;
}