Cod sursa(job #2228114)
Utilizator | Data | 2 august 2018 18:26:51 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
const int nmax=2000005;
using namespace std;
int main()
{
ifstream fin("a.in");
ofstream fout("a.out");
int n,i,j;
bool ciur[nmax]={0};
fin>>n;
for(i=3;i*i<=n;i++) {
if(ciur[i]==0) {
for(j=i*i;j<=n;j+=i) {
ciur[j]=1;
}
}
}
int nr=1;
for(i=3;i<=n;i+=2) {
if(ciur[i]==0)
nr++;
}
fout<<nr<<endl;
fin.close();
fout.close();
return 0;
}