Cod sursa(job #2104507)
Utilizator | Data | 11 ianuarie 2018 19:26:21 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<fstream>
#include<climits>
using namespace std;
const int nMSize = 2000001;
bool numbers[nMSize];
int main() {
ifstream in("ciur.in");
ofstream out("ciur.out");
int N;
in >> N;
int s = 0;
for (int i = 2;i <= N;++i) {
if (!numbers[i]) {
s++;
for (int j = i; i*j <= nMSize;++j)
numbers[i*j] = true;
}
}
out << s;
}