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