From d288f8a9a0b5c46227a64b358e8088719c0c40aa Mon Sep 17 00:00:00 2001 From: "PARZIVAL (BreganIM)" Date: Sun, 13 Apr 2025 23:35:19 +0300 Subject: [PATCH] =?UTF-8?q?code:=D0=B4=D0=BE=D0=B1=D0=B0=D0=B2=D0=BB=D0=B5?= =?UTF-8?q?=D0=BD=20=D0=BD=D0=B0=D1=87=D0=B0=D0=BB=D1=8C=D0=BD=D1=8B=D0=B9?= =?UTF-8?q?=20=D0=BA=D0=BE=D0=B4=20=D0=9B=D0=A01?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- laba01upd3.cpp | 75 ++++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 75 insertions(+) create mode 100644 laba01upd3.cpp diff --git a/laba01upd3.cpp b/laba01upd3.cpp new file mode 100644 index 0000000..e3fbe10 --- /dev/null +++ b/laba01upd3.cpp @@ -0,0 +1,75 @@ +#include +#include +using namespace std; + +const size_t SCREEN_WIDTH = 80; +const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1; + +int main() +{ + size_t number_count; + cout << "Enter number count: "; + cin >> number_count; + vector numbers(number_count); + for (int i = 0; i < number_count; i++) { + cin >> numbers[i]; + } + size_t bin_count; //количество интервалов на которые мы разбиваем + cout << "Enter bin count: "; + cin >> bin_count; + vector bins(bin_count); + double min = numbers[0]; + double max = numbers[0]; + for (double x : numbers) { + if (x < min) { + min = x; + } + else if (x > max) { + max = x; + } + } + double bin_size = (max - min) / bin_count; + for (size_t i = 0; i < number_count; i++) { + bool found = false; + for (size_t j = 0; (j < bin_count - 1) && !found; j++) { + auto lo = min + j * bin_size; + auto hi = min + (j + 1) * bin_size; + if ((lo <= numbers[i]) && (numbers[i] < hi)) { + bins[j]++; + found = true; + } + } + if (!found) { + bins[bin_count - 1]++; + } + } + double max_count = bins[0]; + for (double x : bins) { + if (x > max_count) { + max_count = x; + } + } + for (int j = 0; j < bin_count; j++) { + if (bins[j] < 100) { + cout << " "; + } + if (bins[j] < 10) { + cout << " "; + } + cout << bins[j] << "|"; + + size_t height; + if (max_count > MAX_ASTERISK) { + size_t count = bins[j]; + height = 76 * (static_cast(count) / max_count); + } + else { + height = bins[j]; + } + + for (size_t i = 0; i < height; i++) { + cout << "*"; + } + cout << endl; + } +} \ No newline at end of file