From f132394a229d75b24746d8a981e0aa5e30cf5d8d Mon Sep 17 00:00:00 2001
From: "Artyom (StepanovAV)" <StepanovAV@mpei.ru>
Date: Sat, 20 Apr 2024 15:00:19 +0300
Subject: [PATCH] =?UTF-8?q?code:=20=D0=B2=D0=B2=D0=BE=D0=B4=20=D0=B4=D0=B0?=
 =?UTF-8?q?=D0=BD=D0=BD=D1=8B=D1=85=20=D0=B2=D1=8B=D0=B4=D0=B5=D0=BB=D0=B5?=
 =?UTF-8?q?=D0=BD=20=D0=B2=20=D0=BE=D1=82=D0=B4=D0=B5=D0=BB=D1=8C=D0=BD?=
 =?UTF-8?q?=D1=83=D1=8E=20=D1=84=D1=83=D0=BD=D0=BA=D1=86=D0=B8=D1=8E?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 main.cpp | 47 +++++++++++++++++++++++++++++------------------
 1 file changed, 29 insertions(+), 18 deletions(-)

diff --git a/main.cpp b/main.cpp
index e9149cb..ae1c1d1 100644
--- a/main.cpp
+++ b/main.cpp
@@ -6,18 +6,31 @@ using namespace std;
 const size_t SCREEN_WIDTH = 80;
 const size_t MAX_LENGTH = SCREEN_WIDTH - 3 - 1;
 
-int main() {
-    int number_count, bin_count, i, j;
-    cerr << "Enter number count:" << endl;
+struct Input {
+    vector<double> numbers;
+    size_t bin_count{};
+};
+
+Input
+input_data(){
+    size_t number_count;
     cin >> number_count;
+    Input in;
+    in.numbers.resize(number_count);
     vector<double> numbers(number_count);
-    cerr << "Enter numbers:" << endl;
-    for (i = 0;i < number_count; i++) {
-        cin >> numbers[i];
+    for (size_t i = 0; i < number_count; i++) {
+        cin >> in.numbers[i];
     }
-    auto min = numbers[0];
-    auto max = numbers[0];
-    for (auto x : numbers) {
+    cin >> in.bin_count;
+    return in;
+}
+
+int
+main() {
+    Input in = input_data();
+    auto min = in.numbers[0];
+    auto max = in.numbers[0];
+    for (auto x : in.numbers) {
         if (x < min) {
             min = x;
         }
@@ -25,19 +38,17 @@ int main() {
             max = x;
         }
     }
-    cerr << "Enter bin count:" << endl;
-    cin >> bin_count;
-    double bin_size = (max - min) / bin_count;
-    vector<size_t> bins(bin_count);
-    for (i = 0; i < number_count; i++) {
+    double bin_size = (max - min) / in.bin_count;
+    vector<size_t> bins(in.bin_count);
+    for (auto i = 0; i < in.number_count; i++) {
         bool found = false;
-        for (j = 0; (j < bin_count - 1) && !found ; j++) {
-            if ((min + j * bin_size <= numbers[i]) && (numbers[i] < min + (j + 1) * bin_size)) {
+        for (auto j = 0; (j < in.bin_count - 1) && !found ; j++) {
+            if ((min + j * bin_size <= in.numbers[i]) && (in.numbers[i] < min + (j + 1) * bin_size)) {
                 bins[j] += 1;
                 found = true;
             }
         }
-        if (!found) bins[bin_count - 1]++;
+        if (!found) bins[in.bin_count - 1]++;
     }
     auto max_count = bins[0];
     for (auto x : bins) {
@@ -45,7 +56,7 @@ int main() {
             max_count = x;
         }
     }
-    for (i = 0; i < bin_count; i++) {
+    for (i = 0; i < in.bin_count; i++) {
         j = 100;
         while (bins[i] < j) {
             cout << " ";