Cod sursa(job #2146676)
Utilizator | Data | 28 februarie 2018 09:39:59 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <fstream>
std::ifstream f("ciur.in");
std::ofstream g("ciur.out");
int prim[2000005], sol, n, i, j;
int main() {
f >> n;
for (i = 2; i <= n; i++)
if (prim[i] == 0) {
sol++;
for (j = i+i; j <= n; j+=i)
prim[j] = 1;
}
g << sol;
}