Cod sursa(job #1916297)
Utilizator | Data | 9 martie 2017 08:57:36 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<fstream>
#include<cmath>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool v[2000001];
int main(){
int n,i,j,s=0,sn;
fin>>n;
for(i=1;i<=n;i++)v[i]=true;
sn=sqrt(n)+1;
for(i=2;i<=sn;i++)
if(v[i])
for(j=2;j*i<=n;j++)v[j*i]=false;
for(i=2;i<=n;i++)
if(v[i])++s;
fout<<s<<'\n';
fin.close();
fout.close();
return 0;
}