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

.gitignore

@@ -0,0 +1,2 @@
+bin/
+obj/

main.cpp

@@ -3,34 +3,58 @@
 
 using namespace std;
 
+struct Input {
+    vector<double> numbers;
+    size_t bin_count{};
+};
+
+Input
+input_data() {
+    size_t number_count;
+    Input in;
+
+    cerr << "Enter number count: ";
+    cin >> number_count;
+    vector<double> numbers(number_count);
+
+    in.numbers.resize(number_count);
+
+    for (size_t i = 0; i < number_count; i++) {
+        cin >> in.numbers[i];
+    }
+
+    cerr << "Enter bins count: ";
+    cin >> in.bin_count;
+    return in;
+}
+
+void
+    find_minmax(const vector<double>& numbers, double& min, double& max) {
+    min = numbers[0];
+    max = numbers[0];
+    // (çäåñü êîä ïîèñêà ìèíèìóìà è ìàêñèìóìà)
+    for (double value : numbers)
+    {
+        if (value < min) {min = value;}
+        else if (value > max) {max = value;}
+    }
+}
+
 int main()
 {
     const size_t SCREEN_WIDTH = 80;
     const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1;
 
-    size_t number_count;
+    Input in = input_data();
-    size_t bin_count;
 
-    cerr << "Enter number count: ";
+    double min, max;
-    cin >> number_count;
+    find_minmax(in.numbers, min, max);
-    vector<double> numbers(number_count);
 
-    for (size_t i = 0; i < number_count; i++)
-        cin >> numbers[i];
-
-    double min = numbers[0];
-    double max = numbers[0];
     double max_count = 0;
 
-    for (double value : numbers)
+    size_t bin_count=in.bin_count;
-    {
-        if (value < min) {min = value;}
-        else if (value > max) {max = value;}
-    }
-
-    cerr << "Enter bins count: ";
-    cin >> bin_count;
     vector<size_t> bins(bin_count);
+    size_t number_count=in.numbers.size();
 
     double bin_size = (max - min) / bin_count;
 
@@ -38,7 +62,7 @@ int main()
     {
         for (size_t j = i + 1; j < number_count; j++)
         {
-            if (numbers[i] == numbers[j])
+            if (in.numbers[i] == in.numbers[j])
             {
                 //numbers.erase(numbers.begin() + j);
                 //number_count--;
@@ -55,7 +79,7 @@ int main()
         {
                 auto low_bound = min + j * bin_size;
                 auto high_bound = min + (j + 1) * bin_size;
-                if ((low_bound <= numbers[i]) && (numbers[i] < high_bound))
+                if ((low_bound <= in.numbers[i]) && (in.numbers[i] < high_bound))
                 {
                     bins[j]++;
                     found = true;