Cod sursa(job #2200972)
Utilizator | Data | 2 mai 2018 22:58:36 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
#include <cstring>
#define DN 2000005
using namespace std;
bool prim[DN];
int main() {
ifstream f("ciur.in");
ofstream g("ciur.out");
int n, rez=0;
memset(prim,1, sizeof(prim));
f>>n;
for (int i=2; i<=n ; ++i) {
if (prim[i] == true) {
++rez;
for (int j=i; j<=n ; j+=i)
prim[j] = false;
}
}
g<<rez;
return 0;
}