Cod sursa(job #2246762)
Utilizator | Data | 27 septembrie 2018 15:27:51 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main()
{
bool eprim[2000005];
int lng,k=0;
fin>>lng;
for(int i=1;i<=lng;i++)
eprim[i]=1;
for(int i=2;i<=lng;i++)
if(eprim[i])
for(int j=i+i;j<=lng;j+=i)
eprim[j]=0;
for(int i=2;i<=lng;i++)
if(eprim[i]==1)
k++;
fout<<k;
return 0;
}