From 5715ca0d277964e484cf897bfb8cbe66c9517bdf Mon Sep 17 00:00:00 2001
From: TarasovEE <TarasovYY@mpei.ru>
Date: Thu, 17 Apr 2025 20:07:08 +0300
Subject: [PATCH] =?UTF-8?q?main:=20=D0=BE=D1=81=D0=BD=D0=BE=D0=B2=D0=BD?=
 =?UTF-8?q?=D0=B0=D1=8F=20=D0=BF=D1=80=D0=BE=D0=B3=D1=80=D0=B0=D0=BC=D0=BC?=
 =?UTF-8?q?=D0=B0?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

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

diff --git a/main.cpp b/main.cpp
new file mode 100644
index 0000000..d644274
--- /dev/null
+++ b/main.cpp
@@ -0,0 +1,97 @@
+#include <iostream>
+#include <vector>
+using namespace std;
+
+int main()
+{
+//  Ввод оценкок с клавиатуры.
+
+    const size_t SCREEN_WIDTH = 80;
+    const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1;
+    size_t number_count, bin_count;
+
+    cerr << "Enter number count: ";
+    cin >> number_count;
+
+    vector<double> numbers(number_count);
+
+    for (size_t i = 0; i < number_count; i++)
+        cin >> numbers[i];
+
+    cerr << "Enter bin count: ";
+    cin >> 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;
+
+    vector<size_t> bins(bin_count);
+
+    for (size_t i = 0; i < bin_count; i++)
+        bins[i] = 0;
+
+//  Сортировка оценок по корзинам.
+
+    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]++;
+        }
+
+//  Поиск максимального количесва оценок в одном столбце.
+
+    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;
+    size_t buf;
+
+    for (size_t i = 0; i < bin_count; i++)
+        {
+            buf = bins[i];
+            while (buf < max_count) //  Выравнивание для чисел, меньших чем максимальное число.
+                {
+                    cout << " ";
+                    buf *= 10;
+                }
+            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;
+        }
+    return 0;
+}