From 934f4788fbf4641e3093e1f96c1e73d080e819c3 Mon Sep 17 00:00:00 2001
From: SukhotinMD <SukhotinMD@mpei.ru>
Date: Mon, 26 May 2025 11:19:21 +0300
Subject: [PATCH] =?UTF-8?q?code:=20=D0=94=D0=BE=D0=B1=D0=B0=D0=B2=D0=BB?=
 =?UTF-8?q?=D0=B5=D0=BD=D0=B0=20=D1=84=D1=83=D0=BD=D0=BA=D1=86=D0=B8=D1=8F?=
 =?UTF-8?q?=20find=5Fmax?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .gitignore                    |  1 +
 ProgUit Lab1/ProgUit Lab1.cpp | 32 ++++++++++++++++++++++----------
 2 files changed, 23 insertions(+), 10 deletions(-)

diff --git a/.gitignore b/.gitignore
index 2282dd4..5b16810 100644
--- a/.gitignore
+++ b/.gitignore
@@ -1,4 +1,5 @@
 ProgUit Lab1.vcxproj
 ProgUit Lab1.vcxproj.filters
 ProgUit Lab1.vcxproj.user
+ProgUit Lab1/ARM64
 /ARM64
\ No newline at end of file
diff --git a/ProgUit Lab1/ProgUit Lab1.cpp b/ProgUit Lab1/ProgUit Lab1.cpp
index e42bd18..1035d47 100644
--- a/ProgUit Lab1/ProgUit Lab1.cpp	
+++ b/ProgUit Lab1/ProgUit Lab1.cpp	
@@ -11,6 +11,7 @@ struct Input {
 };
 
 Input
+
 input_data() {
 	// Функция ввода
 	//Создание переменных
@@ -38,6 +39,15 @@ input_data() {
 	return in;
 }
 
+void
+find_minmax(const vector<double>& numbers, double& min_in_numbers, double& max_in_numbers) {
+	min_in_numbers = numbers[0];
+	max_in_numbers = *(max_element(begin(numbers), end(numbers)));
+	min_in_numbers = *(min_element(begin(numbers), end(numbers)));
+	
+}
+
+
 int main()
 {
 	
@@ -53,21 +63,23 @@ int main()
 
 	// Объявление перменных промежуточных/вывода
 
-	vector <size_t> bins(bin_count);
-	double max_in_numbers = *(max_element(begin(numbers), end(numbers)));
-	double min_in_numbers = *(min_element(begin(numbers), end(numbers)));
+	vector <size_t> bins(in.bin_count);
+
+	double min_in_numbers, max_in_numbers;
+	find_minmax(in.numbers, min_in_numbers, max_in_numbers);
+
 
 
-	double bin_size = (max_in_numbers - min_in_numbers) / bin_count;
+	double bin_size = (max_in_numbers - min_in_numbers) / in.bin_count;
 
 	int max_in_bins = 0;
 	
 
 	// Код
 
-	for (size_t i = 0; i < number_count; i++) {
-		int to_bin = int((numbers[i]) - min_in_numbers) / bin_size;
-		if (to_bin >= bin_count) {
+	for (size_t i = 0; i < in.numbers.size(); i++) {
+		int to_bin = int((in.numbers[i]) - min_in_numbers) / bin_size;
+		if (to_bin >= in.bin_count) {
 			bins[to_bin - 1]++;
 		}
 		else {
@@ -75,7 +87,7 @@ int main()
 		}
 	}
 	// Максимальное в коорзинах
-	for (int i = 0; i < bin_count; i++) {
+	for (int i = 0; i < in.bin_count; i++) {
 		if (bins[i] > max_in_bins) {
 			max_in_bins = bins[i];
 		}
@@ -84,7 +96,7 @@ int main()
 
 	if (max_in_bins > MAX_ASTERISK) {
 
-		for (int i = 0; i < bin_count; i++) {
+		for (int i = 0; i < in.bin_count; i++) {
 			if (bins[i] < 100) {
 				cout << " ";
 			}
@@ -105,7 +117,7 @@ int main()
 
 	} else {
 		// Если максимальное число среди коорзин меньше или равно 76
-		for (int i = 0; i < bin_count; i++) {
+		for (int i = 0; i < in.bin_count; i++) {
 			if (bins[i] < 100) {
 				cout << " ";
 			}