Cod sursa(job #2064076)
Utilizator | Data | 11 noiembrie 2017 19:22:47 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,ciur[2000005]={0},d, j,nr=0;
int main()
{
fin>>n;
ciur[0]=ciur[1]=1;
for(d=2;d*d<=n;d++)
if (!ciur[d])
for (j=2;j*d<=n;j++)
ciur[j*d]=1;
for(int i=2;i<=n;i++)
if(ciur[i]==0)
nr++;
fout << nr;
return 0;
}