From 8d01744e6d401c4eb03d397b607ca00b5bd22707 Mon Sep 17 00:00:00 2001 From: MatusSV Date: Mon, 13 May 2024 07:26:34 +0300 Subject: [PATCH] =?UTF-8?q?1.=20=D0=98=D0=BC=D0=BF=D0=BE=D1=80=D1=82=20?= =?UTF-8?q?=D0=BA=D0=BE=D0=B4=D0=B0=20=D0=9B=D0=A0=20=E2=84=96=201=20?= =?UTF-8?q?=D0=B2=20Git?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- Lab1.cbp | 39 +++++++++++++++++++++++++ main.cpp | 87 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++ 2 files changed, 126 insertions(+) create mode 100644 Lab1.cbp create mode 100644 main.cpp diff --git a/Lab1.cbp b/Lab1.cbp new file mode 100644 index 0000000..97bdf05 --- /dev/null +++ b/Lab1.cbp @@ -0,0 +1,39 @@ + + + + + + diff --git a/main.cpp b/main.cpp new file mode 100644 index 0000000..8059e16 --- /dev/null +++ b/main.cpp @@ -0,0 +1,87 @@ +#include +#include + +using namespace std; + +int main() +{ + const size_t SCREEN_WIDTH = 80; + const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1; + + size_t number_count; + size_t bin_count; + + cerr << "Enter number count: "; + cin >> number_count; + vector numbers(number_count); + + for (size_t i = 0; i < number_count; i++) + cin >> numbers[i]; + + double min = numbers[0]; + double max = numbers[0]; + double max_count = 0; + + for (double value : numbers) + { + if (value < min) {min = value;} + else if (value > max) {max = value;} + } + + cerr << "Enter bins count: "; + cin >> bin_count; + vector bins(bin_count); + + double bin_size = (max - min) / bin_count; + + for (size_t i = 0; i < number_count; i++) + { + for (size_t j = i + 1; j < number_count; j++) + { + if (numbers[i] == numbers[j]) + { + //numbers.erase(numbers.begin() + j); + //number_count--; + //i--; + //cout << "Removed number " << numbers[j] << endl; + } + } + } + + for (size_t i = 0; i < number_count; i++) + { + bool found = false; + for (size_t j = 0; (j < bin_count - 1) && !found; j++) + { + auto low_bound = min + j * bin_size; + auto high_bound = min + (j + 1) * bin_size; + if ((low_bound <= numbers[i]) && (numbers[i] < high_bound)) + { + bins[j]++; + found = true; + if (bins[j] > max_count) + max_count = bins[j]; + } + } + + if (!found) + { + bins[bin_count - 1]++; + if (bins[bin_count - 1] > max_count) + max_count = bins[bin_count - 1]; + } + } + for (size_t bin : bins) + { + if (bin < 100) cout << " "; + if (bin < 10) cout << " "; + cout << bin; + cout << "|"; + size_t height = MAX_ASTERISK * (static_cast(bin) / max_count); + if (max_count <= MAX_ASTERISK) height = bin; + for (size_t i = 0; i < height; i++) cout << "*"; + cout << endl; + } + + return 0; +}