Cod sursa(job #2094424)
| Utilizator | Data | 25 decembrie 2017 20:37:12 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
#define dMAX 2000001
using namespace std;
int counter, N;
bool prime[dMAX];
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main()
{
int i, j;
fin >> N;
prime[1] = true;
for (i = 2; i <= N; i++) {
if (!prime[i]) {
counter++;
for (j = i + i; j <= N; j += i) {
prime[j] = true;
}
}
}
fout << counter;
return 0;
}
