Cod sursa(job #1526061)
Utilizator | Data | 15 noiembrie 2015 21:30:12 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
int a[2000001];
int main()
{
int nr = 0; int i, j, n;
ifstream f("ciur.in");
ofstream g("ciur.out");
f >> n;
for (i = 2; i <= n; i++) {
if (a[i] == 0) {
a[i] = 1;
for (j = i + i; j <= n; j += i)
a[j] = 1;
nr ++;
}
}
g << nr;
f.close ();
g.close ();
return 0;
}