Cod sursa(job #2029196)
Utilizator | Data | 29 septembrie 2017 17:23:21 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int n,i,j,nr;
bool a[2000001];
int main(){
fin>>n;
for(i=2;i<=2000001;i++)
a[i]=1;
for(i=2;i*i<=2000001;i++)
if(a[i])
for(j=i;j<=2000001/i;j++)
a[i*j]=0;
for(i=1;i<=n;i++)
if(a[i])
++nr;
fout<<nr;
}