Cod sursa(job #579913)
Utilizator | Data | 12 aprilie 2011 16:15:51 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include<fstream.h>
using namespace std;
int n, i, j, nrp;
bool a[2000001];
int main()
{ ifstream f("ciur.in");
ofstream h("ciur.out");
f>>n;
for (i=2; i<=n; i++)
if (a[i]==0)
{nrp=nrp+1;
for (j=2*i; j<=n; j+=i)
a[j]=1;
}
h<<nrp<<'\n';
f.close();
h.close();
return 0;
}