Cod sursa(job #2362610)
Utilizator | Data | 3 martie 2019 11:19:13 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
#define NRMARE 2000005
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool prim[NRMARE];
int main()
{
int n,i,nr=0,j;
fin>>N;
for(i=1;i<=n;++i)
prim[i]=1;
for(i=2;i<=n;++i)
if(prim[i]==1)
{
nr++;
for(j=i+i;j<=n;j+=i)
prim[j]=0;
}
fout<<nr;
return 0;
}