Cod sursa(job #2834737)
| Utilizator | Data | 17 ianuarie 2022 16:35:40 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 90 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
using namespace std;
const int NMAX = 2e6;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
bool ciur[NMAX];
int n,c;
int main()
{
fin >> n;
for (int i = 2; i <= n; ++i)
ciur[i] = true;
for (int i = 2; i * i <= n; ++i)
if (ciur[i])
for (int j = 2; i * j <= n; ++j)
ciur[i * j] = false;
for(int i = 1; i <= n; ++i)
if(ciur[i] == true)
c++;
fout<<c;
return 0;
}
