Cod sursa(job #1389291)
Utilizator | Data | 16 martie 2015 09:53:43 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include<fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout ("ciur.out");
bool v[2000001];
long n;
int main()
{int i ,j,nr=0;
fin>>n;
fout<<n<<" ";
for(i=2;i*i<=n;i++)
{if(v[i]==0)
for(j=i*i;j<=n;j=j+i)
v[j]=1;
for(i=2;i<n;i++)
if(v[i]==0) nr++;
fout<<nr;
return 0;
}