Cod sursa(job #2488135)
Utilizator | Data | 6 noiembrie 2019 10:16:45 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,i,nr=0,j;
bool ciur[2000000];
int main()
{
ciur[0]=1;
ciur[1]=1;
for(i=2;i<=2000000;i++)
if(ciur[i]==0)
for(j=2*i;j<=2000000;j=j+i)
ciur[j]=1;
fin>>n;
for(i=1;i<=n;i++)
if(ciur[i]==0)
nr++;
fout<<nr;
return 0;
}