Cod sursa(job #2227707)
Utilizator | Data | 1 august 2018 16:21:05 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
const int nmax=2000001;
using namespace std;
int main()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,i,j;
bool ciur[nmax];
fin>>n;
for(i=2;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;
}