Cod sursa(job #2110559)
Utilizator | Data | 20 ianuarie 2018 21:10:59 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.28 kb |
#include<fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n, k;
bool a[2000001];
int main() {
fin >> n;
for (int i = 2;i <= n;i++) {
if (!a[i]) {
for (int j = i + i;j <= n;j+=i) {
a[j] = 1;
}
k++;
}
}
fout << k;
}