Cod sursa(job #2692603)
| Utilizator | Data | 3 ianuarie 2021 12:20:11 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include<fstream>
#include<cstring>
#include<string.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main()
{
int n, nr = 0;
bool* ciur;
fin >> n;
ciur = new bool[n + 1];
memset(ciur, false, sizeof(bool) * (n + 1));
for (int i = 2; i <= n; i++)
if (ciur[i] == false)
{
nr++;
for (int j = i * i; j <= n; j += i)
ciur[j] = true;
}
delete[] ciur;
fout << nr;
}