Cod sursa(job #652980)
Utilizator | Data | 26 decembrie 2011 22:59:35 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int i,n,j,r;
bool q[2000500];
int main()
{
f>>n;
for(i=2; i<=n; i++) if (q[i]==0) {
r++;
for(j=i*i; j<=n; j+=i) q[j]=1;
}
g<<r<<'\n';
f.close();
g.close();
return 0;
}