Cod sursa(job #3370307)
| Utilizator | Data | 25 octombrie 2026 12:16:20 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
#include <vector>
using namespace std;
void afs_div(int n) {
ofstream fout("ciur.out");
vector <bool> v(n+1,true);
for (int i=2;i*i<=n;i++) {
if (v[i]) {
for (int j=i*i;j<=n;j+=i) {
v[j]=false;
}
}
}
int cnt=0;
for (int i=2;i<=n;i++) {
cnt+= v[i];
}
fout<<cnt;
fout.close();
}
int main() {
ifstream fin("ciur.in");
int n;
fin>>n;
afs_div(n);
fin.close();
return 0;
}