code: добавлена структура для входных данных и функция ввода

main.cpp

@@ -3,24 +3,36 @@
 
 using namespace std;
 
-int main()
-{
-    const size_t SCREEN_WIDTH = 80;
-    const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1;
-    size_t number_count, bin_count;
+struct Input {
+    vector<double> numbers;
+    size_t bin_count{};
+};
+
+Input
+input_data() {
+    size_t number_count;
     cerr << "Enter number count: ";
     cin >> number_count;
-    vector<double> numbers(number_count);
+    Input in;
+    in.numbers.resize(number_count);
     for (size_t i = 0; i < number_count; i++)
     {
-        cin >> numbers[i];
+        cin >> in.numbers[i];
     }
     cerr << "Enter bin count: ";
-    cin >> bin_count;
-    vector<size_t> bins(bin_count);
-    double min = numbers[0];
-    double max = numbers[0];
-    for (double x : numbers)
+    cin >> in.bin_count;
+    return in;
+}
+
+int main()
+{
+    const size_t SCREEN_WIDTH = 80;
+    const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1;
+    Input in = input_data();
+    vector<size_t> bins(in.bin_count);
+    double min = in.numbers[0];
+    double max = in.numbers[0];
+    for (double x : in.numbers)
     {
         if (x < min)
         {
@@ -31,15 +43,15 @@ int main()
             max = x;
         }
     }
-    auto bin_size = (max - min)/bin_count;
-    for (size_t i = 0; i < number_count; i++)
+    auto bin_size = (max - min)/in.bin_count;
+    for (double number : in.numbers)
     {
         bool found = false;
-        for (size_t j = 0; (j < bin_count - 1) && !found; j++)
+        for (size_t j = 0; (j < in.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))
+            if ((lo <= number) && (number < hi))
             {
                 bins[j]++;
                 found = true;
@@ -47,11 +59,11 @@ int main()
         }
         if (!found)
         {
-            bins[bin_count - 1]++;
+            bins[in.bin_count - 1]++;
         }
     }
     size_t max_count = 0;
-    for (size_t s = 0; s < bin_count; s++) {
+    for (size_t s = 0; s < in.bin_count; s++) {
         if (bins[s] > max_count)
             {
                 max_count = bins[s];