Cod sursa(job #1727830)
Utilizator | Data | 11 iulie 2016 18:32:15 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
int main() {
int N, c = 0;
ifstream f("ciur.in");
f >> N;
f.close();
bool* A = new bool[N + 1];
for (int i = 2; i <= N; ++i) {
A[i] = true;
}
for (int i = 2; i <= N; ++i) {
if (A[i]) {
c++;
for (int j = i + i; j <= N; j += i) {
A[j] = false;
}
}
}
ofstream g("ciur.out");
g << c << "\n";
g.close();
return 0;
}