Cod sursa(job #861050)
Utilizator | Data | 20 ianuarie 2013 22:14:13 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<fstream>
#include<cmath>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool v[2000001];
int i,j,n,nr;
int main()
{ f>>n;
for(i=2;i<=n;i++) if(!v[i]) { nr++;
if(i<sqrt(n))
for(j=i+i;j<=n;j+=i) v[j]=1;
}
g<<nr;
f.close();
g.close();
return 0;
}