Cod sursa(job #2504549)
Utilizator | Data | 5 decembrie 2019 08:55:06 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
bool c[2000005];
int main()
{
int n,i,j,nrprime=0;
fin>>n;
c[0]=c[1]=true;
for(i=2;i*i<=n;i++)
{
if(!c[i])
for(j=i*i;j<=n;j+=i)
{
c[j]=true;
}
}
for(int i=0; i<n;i++)
{
if(c[i]==false)
nrprime++;
}
fout<<nrprime;
return 0;
}