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