From ee455a014d5362f7c4e600e0149dc24d05755a43 Mon Sep 17 00:00:00 2001
From: KIrsanovEs <KirsanovYs@mpei.ru>
Date: Sat, 22 Apr 2023 16:03:30 +0300
Subject: [PATCH] =?UTF-8?q?code:=20=D0=B8=D0=B7=D0=BC=D0=B5=D0=BD=D1=91?=
 =?UTF-8?q?=D0=BD=20main=20=D0=BF=D1=80=D0=B8=20=D0=BF=D0=BE=D0=BC=D0=BE?=
 =?UTF-8?q?=D1=89=D0=B8=20=D1=84=D1=83=D0=BD=D0=BA=D1=86=D0=B8=D0=B9?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 main.cpp | 37 +++++++++++++++++++++----------------
 1 file changed, 21 insertions(+), 16 deletions(-)

diff --git a/main.cpp b/main.cpp
index 45e8546..473cf83 100644
--- a/main.cpp
+++ b/main.cpp
@@ -5,20 +5,22 @@ using namespace std;
 struct Input {
     vector<double> numbers;
     size_t bin_count{};
+
 };
 Input
 input_data(){
+    size_t number_count;
+    cin >> number_count;
+
     Input in;
-size_t number_count;
-cin >> number_count;
-in.numbers.resize(number_count);
-    for (size_t i = 0; i < number_count; i++) {
-        cin >> in.numbers[i];
-    }
-cin >> in.bin_count;
+    in.numbers.resize(number_count);
+        for (size_t i = 0; i < number_count; i++) {
+            cin >> in.numbers[i];
+        }
+    cin >> in.bin_count;
 return in;
 }
-    void find_minmax(vector<double> numbers, double min, double max) {
+    void find_minmax(vector<double> numbers, double& min, double& max) {
     min = numbers[0];
     max = numbers[0];
     for (double x : numbers) {
@@ -34,24 +36,27 @@ return in;
 
 int main()
 {   Input in = input_data();
-    double bin_size = (max - min) / bin_count;
-        vector<size_t> bins(bin_count);
-    for (size_t i = 0; i < number_count; i++) {
+    double max,min;
+    find_minmax(in.numbers,min,max);
+    double bin_size = (max - min) / in.bin_count;
+        vector<size_t> bins(in.bin_count);
+        for(double x: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 <= x) && (x < hi)) {
             bins[j]++;
             found = true;
         }
     }
     if (!found)
-        bins[bin_count-1]++;
+        bins[in.bin_count-1]++;
     }
-    for(size_t i=0;i<bin_count;i++){
+    for(size_t i=0;i<in.bin_count;i++){
         cout<<bins[i]<<"|";
-        for(size_t j=0;j<=i;j++)
+        for(size_t j=0;j<bins[i];j++)
             cout<<"*";
         cout<<endl;}
 }