Cod sursa(job #585297)
Utilizator | Data | 28 aprilie 2011 20:50:32 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<fstream>
using namespace std;
int n,nrp;
bool ciur[2000002];
int main()
{
long long i,j;
ifstream fin("ciur.in");
fin>>n;
fin.close();
nrp=1;
for(i=3;i<=n;i+=2)
if(ciur[i]==false)
{
nrp++;
for(j=i*i;j<=n;j+=2*i)
ciur[j]=true;
}
ofstream fout("ciur.out");
fout<<nrp<<"\n";
fout.close();
return 0;
}