Cod sursa(job #2491843)
Utilizator | Data | 13 noiembrie 2019 12:43:12 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
#define NMAX 2000005
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool ciur[NMAX];
int nr;
int n;
void ciurErathostene()
{
for(int i=2;i<=n;i++)
{
if(!ciur[i])
{
nr++;
for(int j=i+i;j<=n;j+=i)
{
ciur[j] = true;
}
}
}
}
int main()
{
fin>>n;
ciurErathostene();
fout<<nr;
return 0;
}