From 694fed61f4b0b5ca19a78c7e0a49ed6fe128800a Mon Sep 17 00:00:00 2001
From: "Ivan (BeloziorovIA)" <BeloziorovIA@mpei.ru>
Date: Mon, 21 Apr 2025 14:56:25 +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=D0=B8=D0=B5=20=D1=84=D1=83=D0=BD=D0=BA=D1=86=D0=B8?=
 =?UTF-8?q?=D0=B8=20=D0=B2=D0=B2=D0=BE=D0=B4=D0=B0=20=D0=B8=20=D0=BE=D0=BF?=
 =?UTF-8?q?=D1=80=D0=B4=D0=B5=D0=BB=D0=B5=D0=BD=D0=B8=D1=8F=20=D0=BC=D0=B8?=
 =?UTF-8?q?=D0=B8=D0=BC=D1=83=D0=BC=D0=B0=20=D0=BC=D0=B0=D0=BA=D1=81=D0=B8?=
 =?UTF-8?q?=D0=BC=D1=83=D0=BC=D0=B0?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 main.cpp | 61 ++++++++++++++++++++++++++++++++++++++++++++++----------
 1 file changed, 51 insertions(+), 10 deletions(-)

diff --git a/main.cpp b/main.cpp
index 0c677dd..939aec7 100644
--- a/main.cpp
+++ b/main.cpp
@@ -4,20 +4,49 @@
 #include <vector>
 #include <cmath>
 using namespace std;
-int main() {
-    const size_t SCREEN_WIDTH = 80;
-    const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 3;
-	size_t number_count, bin_count;
-	//Ввод количества элементов массива
+
+//Создание структуры Input для входных данных
+	struct Input {
+        vector<double> Numbers;
+        size_t bin_count{};
+    };
+
+//Функция ввода
+Input input_data(){
+    size_t number_count;
+    Input stct;
+    //Ввод количества элементов массива
     cerr << "Enter number count ";
 	cin >> number_count;
-	//Ввод массива
+    //Ввод массива
 	vector<double> Numbers(number_count);
+	stct.Numbers.resize(number_count);
 	cerr << "Enter array:\n";
 	cin >> Numbers[0];
 	for (int i = 1; i < number_count; i++) {
-		cin >> Numbers[i];
+		cin >> stct.Numbers[i];
 	}
+	//Ввод количества корзин
+	cerr << "Enter bin count\n";
+	cin >> stct.bin_count;
+	//Возвращаем структуру
+	return stct;
+}
+
+//Функция поиска минимума и максиммума
+void find_minmax(const vector<double>& numbers, double& Min, double& Max){
+    Min = numbers[0];
+    Max = numbers[0];
+    for (int i = 1; i < numbers.size(); i++) {
+		if (numbers[i] > Max)
+			Max = numbers[i];
+		if (numbers[i] < Min)
+			Min = numbers[i];
+	}
+
+}
+
+/*
 	//Поиск максимума
 	double max = Numbers[0];
 	for (int i = 1; i < number_count; i++) {
@@ -30,10 +59,21 @@ int main() {
 		if (Numbers[i] < min)
 			min = Numbers[i];
 	}
-	//Ввод количества корзин
-	cerr << "Enter bin count\n";
-	cin >> bin_count;
 
+	*/
+
+int main() {
+    const size_t SCREEN_WIDTH = 80;
+    const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 3;
+
+	//Ввод массива и количества корзин
+	Input in = input_data();
+
+	//Определение минимума и максимума
+	double max, min;
+	find_minmax(in.Numbers, min, max);
+
+	/*
 	//Определение шага между корзинами
 	double bin_size = (max - min) / bin_count;
 	//Массив корзин
@@ -92,5 +132,6 @@ int main() {
 		cout << "\n";
     }
 	}
+	*/
 	return 0;
 }