From d98530094c956f59db9bac9e01184445733d5b2a Mon Sep 17 00:00:00 2001
From: "Nikolay (KrivobokovNS)" <KrivobokovNS@mpei.ru>
Date: Wed, 20 Aug 2025 11:39:53 +0300
Subject: [PATCH] =?UTF-8?q?code:=20=D0=B8=D0=B7=D0=BD=D0=B0=D1=87=D0=B0?=
 =?UTF-8?q?=D0=BB=D1=8C=D0=BD=D1=8B=D0=B9=20=D0=BA=D0=BE=D0=B4?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 main.cpp | 117 +++++++++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 117 insertions(+)
 create mode 100644 main.cpp

diff --git a/main.cpp b/main.cpp
new file mode 100644
index 0000000..ad8dc73
--- /dev/null
+++ b/main.cpp
@@ -0,0 +1,117 @@
+#include <iostream>
+#include <vector>
+
+
+using namespace std;
+
+struct Input {
+    vector<double> numbers;
+    size_t bin_count{};
+    size_t number_count{};
+};
+
+Input
+input_data() {
+    Input in;
+
+    size_t number_count;
+    size_t bin_count;
+
+    cerr << "Enter number count: ";
+    cin >> in.number_count;
+    cerr << "Enter bin count: ";
+    cin >> in.bin_count;
+
+    in.numbers.resize(in.number_count);
+
+    for (size_t i = 0; i < in.number_count; i++) {
+        cin >> in.numbers[i];
+    }
+
+    return in;
+};
+
+void find_minmax(const vector<double>& numbers, double& min, double& max) {             //  Поиск максимума и минимума среди оценок.
+    min=numbers[0];
+    max=numbers[0];
+    for (double x : numbers) {
+        if (x<min) {
+            min=x;
+        } else {
+            if (x>max) {
+                max=x;
+            }
+        }
+    }
+
+    return;
+}
+
+vector<size_t> make_histogram(const vector<double>& numbers, size_t bin_count)
+{
+    double min, max;
+    find_minmax(numbers, min, max);
+
+//  Создание корзин для дальнейшей сортировки оценок по ним.
+
+    double bin_size = (max - min) / bin_count;
+    vector<size_t> bins(bin_count);
+    for (size_t i = 0; i < bin_count; i++) {
+        bins[i] = 0;
+    }
+
+//  Сортировка оценок по корзинам.
+
+    for (size_t i = 0; i < numbers.size(); 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]++;
+        }
+    }
+    return bins;
+}
+
+void show_histogram_text(vector<size_t>& bins, size_t bin_count)
+{
+    const size_t SCREEN_WIDTH = 80;
+    const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1;
+    //  Поиск максимального количесва оценок в одном столбце.
+
+    size_t max_count = bins[0];
+
+    for (size_t i = 0; i < bin_count; i++)
+        {
+            if (bins[i] > max_count)
+                max_count = bins[i];
+        }
+
+//  Создание гистограммы по оценкам.
+
+    size_t height;
+
+    for (size_t i = 0; i < bin_count; i++) {
+        cout << bins[i] << "|";
+        height = bins[i];
+        if (max_count > MAX_ASTERISK)
+            height = MAX_ASTERISK * (static_cast<double>(bins[i]) / max_count);
+        for (size_t j = 1; j <= height; j++)
+            cout << "*";
+        cout << endl;
+    }
+}
+
+int main() {
+
+    auto in = input_data();
+    auto bins = make_histogram(in.numbers, in.bin_count);
+    show_histogram_text(bins, in.bin_count);
+    return 0;
+}