From 486ed3f010e369aeca560efd24a26e62c984476b Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=D0=A4=D0=BE=D0=BD=D0=BE=D0=B2=20=D0=90=D0=BB=D0=B5=D0=BA?=
 =?UTF-8?q?=D1=81=D0=B0=D0=BD=D0=B4=D1=80?= <FonovAD@Mpei.ru>
Date: Sat, 22 Apr 2023 18:20:15 +0300
Subject: [PATCH] =?UTF-8?q?Code:=20=D0=94=D0=BE=D0=B1=D0=B0=D0=B2=D0=BB?=
 =?UTF-8?q?=D0=B5=D0=BD=D0=B0=20=D1=81=D1=82=D1=80=D1=83=D0=BA=D1=82=D1=83?=
 =?UTF-8?q?=D1=80=D0=B0=20=D0=B8=20=D1=84=D1=83=D0=BD=D0=BA=D1=86=D0=B8?=
 =?UTF-8?q?=D1=8F=20=D0=B2=D0=B2=D0=BE=D0=B4=D0=B0=20=D1=81=D1=82=D1=80?=
 =?UTF-8?q?=D1=83=D0=BA=D1=82=D1=83=D1=80=D1=8B?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 main.cpp | 44 ++++++++++++++++++++++++++++----------------
 1 file changed, 28 insertions(+), 16 deletions(-)

diff --git a/main.cpp b/main.cpp
index c46b495..07ee2a6 100644
--- a/main.cpp
+++ b/main.cpp
@@ -1,25 +1,37 @@
 #include <iostream>
 #include <vector>
 
-int main()
+struct Input
+{
+    std::vector<double> numbers;
+    size_t bin_count;
+};
+
+Input input_data()
 {
     size_t number_count;
     std::cerr << "Enter number count: ";
     std::cin >> number_count;
-    std::vector<double> numbers(number_count);
+    Input in;
+    in.numbers.resize(number_count);
 
     for (size_t i = 0; i < number_count; i++)
     {
-        std::cin >> numbers[i];
+        std::cin >> in.numbers[i];
     }
 
-    size_t bin_count;
     std::cerr << "Enter bin count: ";
-    std::cin >> bin_count;
-    std::vector<size_t> bins(bin_count);
-    double min = numbers[0];
-    double max = numbers[0];
-    for (double x : numbers)
+    std::cin >> in.bin_count;
+    return in;
+}
+
+int main()
+{
+    Input in = input_data();
+    std::vector<size_t> bins(in.bin_count);
+    double min = in.numbers[0];
+    double max = in.numbers[0];
+    for (double x : in.numbers)
     {
         if (x < min)
         {
@@ -31,16 +43,16 @@ int main()
         }
     }
 
-    double bin_size = (max - min) / bin_count;
+    double bin_size = (max - min) / in.bin_count;
 
-    for (size_t i = 0; i < number_count; i++)
+    for (size_t i = 0; i < in.numbers.size(); i++)
     {
         bool found = false;
-        for (size_t j = 0; (j < bin_count - 1) && !found; j++)
+        for (size_t j = 0; (j < in.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))
+            if ((lo <= in.numbers[i]) && (in.numbers[i] < hi))
             {
                 bins[j]++;
                 found = true;
@@ -48,7 +60,7 @@ int main()
         }
         if (!found)
         {
-            bins[bin_count - 1]++;
+            bins[in.bin_count - 1]++;
         }
     }
 
@@ -73,8 +85,8 @@ int main()
             height = MAX_ASTERISK * (static_cast<double>(bin) / max_count);
         }
 
-        int fraction = bin * 100 / number_count;
-        
+        int fraction = bin * 100 / in.numbers.size();
+
         if (fraction < 100)
             std::cout << ' ';
         if (fraction < 10)