From b35ad63352ca31eca0118275e8a38a730d89ad58 Mon Sep 17 00:00:00 2001
From: Danila <ZhikharevDanS@mpei.ru>
Date: Sat, 22 Apr 2023 14:11:50 +0300
Subject: [PATCH] =?UTF-8?q?code:=20=D0=B2=D1=82=D0=BE=D1=80=D0=BE=D0=B9=20?=
 =?UTF-8?q?=D1=8D=D1=82=D0=B0=D0=BF,=20=D0=B4=D0=BE=20=D1=84=D1=83=D0=BD?=
 =?UTF-8?q?=D0=BA=D1=86=D0=B8=D0=B8=20=D1=80=D0=B0=D1=81=D1=87=D0=B5=D1=82?=
 =?UTF-8?q?=D0=B0=20=D0=B3=D0=B8=D1=81=D1=82=D0=BE=D0=B3=D1=80=D0=B0=D0=BC?=
 =?UTF-8?q?=D0=BC=D1=8B?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 main.cpp | 65 +++++++++++++++++++++++++++++++++-----------------------
 1 file changed, 39 insertions(+), 26 deletions(-)

diff --git a/main.cpp b/main.cpp
index b00c25e..753abb6 100644
--- a/main.cpp
+++ b/main.cpp
@@ -5,25 +5,48 @@
 using namespace std;
 
 struct Input
-    {
-        vector<double> numbers;
-        size_t bin_count{};
-    };
+{
+    vector<double> numbers;
+    size_t bin_count{};
+};
+
+Input input_data()
+{
+    size_t number_count;
+    cin >> number_count;
 
-    Input input_data()
+    Input in;
+    in.numbers.resize(number_count);
+    for (size_t i = 0; i < number_count; i++)
     {
-        size_t number_count;
-        cin >> number_count;
+        cin >> in.numbers[i];
+    }
+    cin>> in.bin_count;
+    return in;
+}
 
-        Input in;
-        in.numbers.resize(number_count);
-        for (size_t i = 0; i < number_count; i++)
+void
+find_minmax(vector<double> numbers, double& min, double& max)
+{
+    min = numbers[0];
+    max = numbers[0];
+    for (double x : numbers)
+    {
+        if (x < min)
         {
-            cin >> in.numbers[i];
+            min = x;
+        }
+        else if (x > max)
+        {
+            max = x;
         }
-        cin>> in.bin_count;
-        return in;
     }
+    return;
+}
+
+
+
+
 
 
 int main()
@@ -40,19 +63,9 @@ int main()
 
     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)
-        {
-            min = x;
-        }
-        else if (x > max)
-        {
-            max = x;
-        }
-    }
+    double min;
+    double max;
+    find_minmax (in.numbers, min, max);
 
     double bin_size = (max - min) / in.bin_count;