Cod sursa(job #2061884)
| Utilizator | Data | 9 noiembrie 2017 19:55:13 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
bool ciur[2000001];
int d,i,j,n,nr;
int main()
{
fin>>n;
ciur[1]=1;
for(d=2;d*d<=n;d++)
if(ciur[d]==0)
{
nr++;
for(j=d*d;j<=n;j=j+d)
{
ciur[j]=1;
}
}
fout<<nr;
/* for(i=2000001;i<=2000000;i++)
ciur[i]=1;
fin>>n;
j=0;
for(i=1;i<=n;i++)
{
if(ciur[i]==0)
j++;
}
fout<<j;*/
return 0;
}
