.gitignore

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

main.cpp

@@ -3,58 +3,34 @@
 
 using namespace std;
 
-struct Input {
+int main()
-    vector<double> numbers;
+{
-    size_t bin_count{};
+    const size_t SCREEN_WIDTH = 80;
-};
+    const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1;
 
-Input
-input_data() {
     size_t number_count;
-    Input in;
+    size_t bin_count;
 
     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 >> numbers[i];
-    for (size_t i = 0; i < number_count; i++) {
-        cin >> in.numbers[i];
-    }
 
-    cerr << "Enter bins count: ";
+    double min = numbers[0];
-    cin >> in.bin_count;
+    double max = numbers[0];
-    return in;
+    double max_count = 0;
-}
 
-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()
+    cerr << "Enter bins count: ";
-{
+    cin >> bin_count;
-    const size_t SCREEN_WIDTH = 80;
-    const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1;
-
-    Input in = input_data();
-
-    double min, max;
-    find_minmax(in.numbers, min, max);
-
-    double max_count = 0;
-
-    size_t bin_count=in.bin_count;
     vector<size_t> bins(bin_count);
-    size_t number_count=in.numbers.size();
 
     double bin_size = (max - min) / bin_count;
 
@@ -62,7 +38,7 @@ int main()
     {
         for (size_t j = i + 1; j < number_count; j++)
         {
-            if (in.numbers[i] == in.numbers[j])
+            if (numbers[i] == numbers[j])
             {
                 //numbers.erase(numbers.begin() + j);
                 //number_count--;
@@ -79,7 +55,7 @@ int main()
         {
                 auto low_bound = min + j * bin_size;
                 auto high_bound = min + (j + 1) * bin_size;
-                if ((low_bound <= in.numbers[i]) && (in.numbers[i] < high_bound))
+                if ((low_bound <= numbers[i]) && (numbers[i] < high_bound))
                 {
                     bins[j]++;
                     found = true;