From c136996085c24e0aae7944d70c3c4f5bbb957979 Mon Sep 17 00:00:00 2001
From: KIrsanovEs <KirsanovYs@mpei.ru>
Date: Sat, 22 Apr 2023 12:08:40 +0300
Subject: [PATCH] =?UTF-8?q?code:=20=D0=B4=D0=BE=D0=B1=D0=B0=D0=B2=D0=BB?=
 =?UTF-8?q?=D0=B5=D0=BD=20=D0=BF=D0=BE=D0=B8=D1=81=D0=BA=20min=20max?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 main.cpp | 37 +++++++++++++++++++++++--------------
 1 file changed, 23 insertions(+), 14 deletions(-)

diff --git a/main.cpp b/main.cpp
index 54cf48b..45e8546 100644
--- a/main.cpp
+++ b/main.cpp
@@ -2,21 +2,25 @@
 #include <vector>
 using namespace std;
 
-int main()
-{
-    size_t number_count,bin_count;
-    double min,max;
-    cout<<"Enter number count: ";
-    cin>>number_count;
-    vector<double> numbers(number_count);
-    for (size_t i=0;i<number_count;i++)
-    {
-        cin>>numbers[i];
+struct Input {
+    vector<double> numbers;
+    size_t bin_count{};
+};
+Input
+input_data(){
+    Input in;
+size_t number_count;
+cin >> number_count;
+in.numbers.resize(number_count);
+    for (size_t i = 0; i < number_count; i++) {
+        cin >> in.numbers[i];
     }
-    cout<<"Enter bin count: ";
-    cin>>bin_count;
-    max=numbers[0];
-    min=numbers[0];
+cin >> in.bin_count;
+return in;
+}
+    void find_minmax(vector<double> numbers, double min, double max) {
+    min = numbers[0];
+    max = numbers[0];
     for (double x : numbers) {
     if (x < min) {
         min = x;
@@ -25,6 +29,11 @@ int main()
         max = x;
     }
 }
+}
+
+
+int main()
+{   Input in = input_data();
     double bin_size = (max - min) / bin_count;
         vector<size_t> bins(bin_count);
     for (size_t i = 0; i < number_count; i++) {