Cod sursa(job #2068066)
Utilizator | Data | 17 noiembrie 2017 09:53:38 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int d,j,n,nr=0;
bool c[2000001];
int main()
{
fin>>n;
c[0]=true;
c[1]=true;
for (int d=2; d<=n; d++)
if (c[d]==false)
for (int j=2; j<=n/d; j++)
c[j*d]=true;
for (int j=1; j<=n; j++)
if (c[j]==false) nr++;
fout<<nr;
return 0;
}