Cod sursa(job #1798488)
Utilizator | Data | 5 noiembrie 2016 11:31:05 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
#include <cmath>
#define dim 2000000
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool b[dim]={0};
int n,i,j,rn,nr=0;
int main()
{ b[0]=1;b[1]=1;
f>>n;rn=sqrt(n);
for(i=2;i<=rn;i++)
{if(b[i]==0){nr++;
for(j=i*i;j<=n;j+=i)
b[j]=1;
}
}
for(i=rn+1;i<=n;i++)
if(b[i]==0)nr++;
g<<nr;
}