From e58335a8df83e923d888a3faa7e18228cb265a03 Mon Sep 17 00:00:00 2001
From: "Andrew (ShabatovAA)" <ShabatovAA@mpei.ru>
Date: Sat, 20 Apr 2024 16:51:20 +0300
Subject: [PATCH] =?UTF-8?q?code:=20=D1=84=D1=83=D0=BD=D0=BA=D1=86=D0=B8?=
 =?UTF-8?q?=D1=8F=20=D0=BF=D0=BE=D0=B8=D1=81=D0=BA=D0=B0=20=D0=BC=D0=B8?=
 =?UTF-8?q?=D0=BD=20=D0=B8=20=D0=BC=D0=B0=D0=BA=D1=81?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 main.cpp | 28 +++++++++++++++++-----------
 1 file changed, 17 insertions(+), 11 deletions(-)

diff --git a/main.cpp b/main.cpp
index 098a9eb..eb44f24 100644
--- a/main.cpp
+++ b/main.cpp
@@ -28,12 +28,10 @@ Input input_data()
     return in;
 }
 
-int main()
+void find_minmax(vector<double> numbers, double& min, double& max)
 {
-    Input in = input_data();
-
-    double min = numbers[0];
-    double max = numbers[0];
+    min = numbers[0];
+    max = numbers[0];
     for (double x : numbers) {
         if (x < min) {
             min = x;
@@ -42,20 +40,28 @@ int main()
             max = x;
         }
     }
-    vector<size_t> bins(bin_count);
-    double bin_size = (max-min)/bin_count;
-    for (size_t i = 0; i < number_count; i++) {
+}
+int main()
+{
+    Input in = input_data();
+
+    double min,max;
+    find_minmax(in.numbers, min, max);
+
+    vector<size_t> bins(in.bin_count);
+    double bin_size = (max-min)/in.bin_count;
+    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 ( (numbers[i] >= lo) && (numbers[i] < hi) ) {
+            if ( (in.numbers[i] >= lo) && (in.numbers[i] < hi) ) {
                 bins[j]++;
                 found = true;
             }
         }
         if (!found) {
-            bins[bin_count-1]++;
+            bins[in.bin_count-1]++;
         }
 
     }