Cod sursa(job #2652910)
| Utilizator | Data | 26 septembrie 2020 13:49:41 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
#include <iostream>
#include <cmath>
#include <vector>
using namespace std;
int ciur(int N) {
int cnt = 0;
vector<bool> arr(N+1, true);
for (int i=2; i<N; ++i) {
if (arr[i]) {
++cnt;
for (int j=i+i; j<N; j+=i) {
arr[j] = false;
}
}
}
return cnt;
}
int main() {
ifstream fin("ciur.in");
ofstream fout("ciur.out");
// istream &fin = cin;
// ostream &fout = cout;
int N;
fin >> N;
fout << ciur(N) << endl;
return 0;
}