Cod sursa(job #2062596)
Utilizator | Data | 10 noiembrie 2017 17:02:53 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
bool E[20000001];
int n,nr;
int main()
{
fin>>n;
for(int i=2;i<=2000000;i++)
E[i]=1;
for(int i=2;i<=n;i++)
{
if(E[i])
for(int j=2;i*j<=n;j++)
E[i*j]=0;
}
for(int i=1;i<=n;i++)
if(E[i])
nr++;
fout<<nr;
return 0;
}