Cod sursa(job #2364591)
Utilizator | Data | 4 martie 2019 09:49:44 | |
---|---|---|---|
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,j,nr;
bool c[2000005];
int main()
{
fin>>n;
c[0]=1;
c[1]=1;
for(i=2; i*i<=n; i++)
if(c[i]==0)
for(j=i; j<=n/i; j++)
c[i*j]=1;
for(i=2; i<=n; i++)
if(c[i]==0)
nr++;
fout<<nr<<'\n';
return 0;
}