Cod sursa(job #2453256)
Utilizator | Data | 3 septembrie 2019 01:44:28 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool ciur[2000005];
int N;
int main()
{
int nr=0;
fin>>N;
for(int i=2; i<=N; i++)
ciur[i]=1;
for(int i=2; i<=N/i; i++)
if(ciur[i])
for(int j=i*i; j<=N; j=j+i)
ciur[j]=0;
for(int i=2; i<=N; i++)
if(ciur[i])
nr++;
fout<<nr<<"\n";
fin.close();
fout.close();
return 0;
}