Cod sursa(job #305782)
Utilizator | Data | 18 aprilie 2009 16:19:05 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include<fstream>
using namespace std;
int p[2000002],nrp,i,j,n;
int main()
{
ifstream in("ciur.in");
ofstream out("ciur.out");
in>>n;
for(i=2;i<=n;i++)
{
if(p[i]==0)
{
nrp++;
for(j=i+i;j<=n;j+=i)
p[j]=-1;
}
}
out<<nrp;
in.close();
out.close();
return 0;
}