From d83432d1e60d0ba2069790bb2217d69830b8f05d Mon Sep 17 00:00:00 2001
From: "Alice (KharisovSR)" <kharisovSR@mpei.ru>
Date: Sun, 21 May 2023 14:13:48 +0300
Subject: [PATCH] =?UTF-8?q?1-3=20=D0=BF=D1=83=D0=BD=D0=BA=D1=82?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 main.cpp | 130 +++++++++++++++----------------------------------------
 1 file changed, 34 insertions(+), 96 deletions(-)

diff --git a/main.cpp b/main.cpp
index 1a42f16..2615a5f 100644
--- a/main.cpp
+++ b/main.cpp
@@ -3,28 +3,39 @@
 
 using namespace std;
 
-int main()
+struct Input
 {
-    size_t number_count;//количество чисел
-    cerr<<"vvod chisel";
-    cin>>number_count;
-
+    vector<double> numbers;
+    size_t bin_count{};
+};
 
-    vector <double> numbers(number_count);//вектор с количсетвом элементов number_count
 
-    cout<<endl;//заполнение вектора
-    for(size_t i=0; i<number_count; i++)
+    Input
+    input_data()
     {
-        cin>>numbers[i];
-    }
+        Input in;
+        size_t number_count;
+        cin>>number_count;
+        in.numbers.resize(number_count);
 
-    size_t bin_count;//количество корзин
-    cin>>bin_count;
-    vector<size_t> bins(bin_count);
+        vector <double> numbers(number_count);
+        cout<<endl;
+        for(size_t i=0; i<number_count; i++)
+        {
+            cin>>in.numbers[i];
+        }
 
-    double min = numbers[0];//поиск мин
-    double max = numbers[0];//поиск макс
-    for (double x : numbers)//цикл дня всех елементов numbers
+        size_t bin_count;
+        cin>>in.bin_count;
+        vector<size_t> bins(bin_count);
+        return in;
+    }
+
+void find_minmax(const vector<double>& numbers, double& min, double& max)
+{
+        min = numbers[0];
+        max = numbers[0];
+        for (double x : numbers)
     {
         if (x < min)
         {
@@ -36,85 +47,12 @@ int main()
         }
     }
 
+}
 
-    double bin_size = (max-min)/bin_count;//размер корзины
-
-    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=0;//максимум элементов в корзине
-    for (size_t i =0; i<bin_count; i++)
-    {
-        if (max_count <bins[i])
-        {
-            max_count=bins[i];
-        }
-    }
-
-
-
-    int proc;
-    int sum =0;
-    for(size_t i=0; i<bin_count; i++)//вывод с процентами
-    {
-
-        if (i==bin_count-1)
-        {
-            proc=100-sum;
-        }
-        else
-        {
-            proc =((float)bins[i] / number_count)*100;
-        }
-
-        sum+=proc;
-
-        if (proc<10)//выравнивание с %
-        {
-            cout<<"  "<<proc<<"% | ";
-        }
-        if ((proc<100)&&(proc>=10))
-        {
-            cout<<" "<<proc<<"% | ";
-        }
-
-        size_t height = 0;
-
-        if (max_count>75)//маштабирование
-        {
-            size_t height = 75 * (static_cast<double>(bins[i]) / max_count);
-            for(size_t j=0; j<=height; j++)
-            {
-
-                cout<<"*";
-            }
-        }
-        else
-        {
-            for(size_t j=0; j<=bins[i]-1; j++)
-            {
-
-                cout<<"*";
-            }
-        }
-
-        cout<<endl;
-    }
+int main()
+{
+    Input in = input_data();
+    double min, max;
+    vector<double> numbers;
+    find_minmax( numbers, min, max);
 }