Cod sursa(job #2470885)
Utilizator | Data | 9 octombrie 2019 20:35:43 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | basic_stuff | Marime | 0.37 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool ciur[2000005];
int main() {
int n, nr = 0, i, j;
in >> n;
for(i = 2; i <= n; i++)
if(!ciur[i]) {
nr++;
for(j = i+i; j <= n; j += i)
ciur[j] = 1;
}
out << nr << endl;
in.close();
out.close();
return 0;
}