Cod sursa(job #2146679)
Utilizator | Data | 28 februarie 2018 09:44:34 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool prim[2000005];
int 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;
}