Cod sursa(job #658688)
Utilizator | Data | 9 ianuarie 2012 12:45:09 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | winners10.1 | Marime | 0.31 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
long long x,rez,i,j, prim[2000005];
int main()
{
f>>x;
for(i=2; i<=x; i++) if (prim[i]==0){
rez++;
for(j=i*i; j<=x; j+=i) prim[j]=1;
}
g<<rez;
f.close();
g.close();
return 0;
}