From af08a5c428d25e5e41c497a92fa3f136c26c6cdc Mon Sep 17 00:00:00 2001
From: TarasovEE <TarasovYY@mpei.ru>
Date: Thu, 17 Apr 2025 21:40:49 +0300
Subject: [PATCH] =?UTF-8?q?main:=202.=20c=D1=82=D1=80=D1=83=D0=BA=D1=82?=
 =?UTF-8?q?=D1=83=D1=80=D0=B8=D1=80=D0=BE=D0=B2=D0=B0=D0=BD=D0=B8=D0=B5=20?=
 =?UTF-8?q?=D0=BF=D1=80=D0=BE=D0=B3=D1=80=D0=B0=D0=BC=D0=BC=D1=8B=20=D0=BF?=
 =?UTF-8?q?=D1=80=D0=B8=20=D0=BF=D0=BE=D0=BC=D0=BE=D1=89=D0=B8=20=D1=84?=
 =?UTF-8?q?=D1=83=D0=BD=D0=BA=D1=86=D0=B8=D0=B9?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 main.cpp | 99 ++++++++++++++++----------------------------------------
 1 file changed, 27 insertions(+), 72 deletions(-)

diff --git a/main.cpp b/main.cpp
index d644274..28fe617 100644
--- a/main.cpp
+++ b/main.cpp
@@ -2,29 +2,38 @@
 #include <vector>
 using namespace std;
 
-int main()
-{
+//  Структура
+
+    struct Input
+    {
+        vector<double> numbers;
+        size_t bin_count{};
+    };
+
 //  Ввод оценкок с клавиатуры.
 
-    const size_t SCREEN_WIDTH = 80;
-    const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1;
+Input
+input_data()
+{
+    Input in;
     size_t number_count, bin_count;
 
     cerr << "Enter number count: ";
     cin >> number_count;
-
-    vector<double> numbers(number_count);
-
+    in.numbers.resize(number_count);
     for (size_t i = 0; i < number_count; i++)
-        cin >> numbers[i];
-
+        cin >> in.numbers[i];
     cerr << "Enter bin count: ";
-    cin >> bin_count;
+    cin >> in.bin_count;
+    return in;
+}
 
 //  Поиск максимума и минимума среди оценок.
 
-    double min = numbers[0];
-    double max = numbers[0];
+void find_minmax(const vector<double>& numbers, double& min, double& max)
+{
+    min = numbers[0];
+    max = numbers[0];
 
     for (double x : numbers)
         {
@@ -33,65 +42,11 @@ int main()
             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;
+int main()
+{
+    auto in = input_data();
+    auto bins = make_histogram(in.numbers, in.bin_count);
+    show_histogram_text(bins, ...);
 }