Cod sursa(job #1382254)
Utilizator | Data | 8 martie 2015 17:52:06 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
ifstream r("ciur.in");
ofstream w("ciur.out");
bool prim[200001];
int n,i,j,nr;
int main() {
r>>n;
for (i=2; i<=n; i++)
if (!prim[i]) {
nr++;
for (j=i; j<=n; j+=i)
prim[j]=true;
}
w<<nr<<"\n";
r.close();
w.close();
return 0;
}