Cod sursa(job #1247404)
Utilizator | Data | 22 octombrie 2014 18:43:56 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int c = 1, n;
bool ciur[2000005];
int main() {
fin >> n;
for (int i = 4; i <= n; i += 2)
ciur[i] = 1;
for (int i = 3; i <= n; i += 2)
if (!ciur[i]) {
c++;
if (i <= n / i)
for (int j = i * i; j <= n; j += i * 2)
ciur[j] = 1;
}
fout << c;
}