From c9d6c80715c670bdd31a8d5259474528e4b59717 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=D0=9F=D0=BE=D0=BB=D1=8C=D0=B7=D0=BE=D0=B2=D0=B0=D1=82?=
 =?UTF-8?q?=D0=B5=D0=BB=D1=8C=20=E2=84=96=204=20=D0=B0=D1=83=D0=B4=D0=B8?=
 =?UTF-8?q?=D1=82=D0=BE=D1=80=D0=B8=D0=B8=20=D0=96-115?=
 <u115-04@public.mpei.local>
Date: Mon, 5 May 2025 13:56:51 +0300
Subject: [PATCH] =?UTF-8?q?code:=20=D0=B4=D0=BE=D0=B1=D0=B0=D0=B2=D0=BB?=
 =?UTF-8?q?=D0=B5=D0=BD=D1=8B=20=D1=84=D1=83=D0=BD=D0=BA=D1=86=D0=B8=D0=B8?=
 =?UTF-8?q?=20=D0=B8=D0=B7=20=D0=9B=D0=A0?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 main.cpp | 98 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 98 insertions(+)

diff --git a/main.cpp b/main.cpp
index 7c5d264..23b6cbc 100644
--- a/main.cpp
+++ b/main.cpp
@@ -2,9 +2,107 @@
 #include <vector>
 
 using namespace std;
+struct Input{
+    vector<double> numbers;
+    size_t bin_count{};
+};
+Input input_data(){
+    Input in;
+    size_t number_count;
+    cerr << "Enter number count: ";
+    cin >> number_count;
+    in.numbers.resize(number_count);
 
+    vector<double> numbers(number_count);
+    for (size_t i = 0; i < number_count; i++) {
+        cin >> in.numbers[i];
+    }
+
+    size_t bin_count;
+    cerr << "Enter bin count";
+    cin >> in.bin_count;
+    return in;
+}
+void find_minmax(vector<double>& numbers, double& min,double& max){
+    min = numbers[0];
+    max = numbers[0];
+    for (double x : numbers)
+    {
+        if (x < min)
+        {
+            min = x;
+        }
+        else if (x > max)
+        {
+            max = x;
+        }
+    }
+}
+vector<double> make_histogram(vector<double>& numbers, size_t bin_count){
+    double min, max;
+    size_t number_count = size(numbers);
+    vector<double> bins(bin_count));
+    find_minmax(numbers, min, max);
+    double bin_size = (max-min)/bin_count;
+    for (size_t i = 0; i < number_count; i++)
+    {
+        bool found = false;
+        for (size_t j = 0; (j < 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))
+            {
+                bins[j]++;
+                found = true;
+            }
+        }
+        if (!found)
+        {
+            bins[bin_count - 1]++;
+        }
+    }
+    return bins;
+}
+void show_histogram_text(vector<double>& bins){
+    int maxbin = 0;
+    for(int bin : bins){
+        if(bin > maxbin){
+            maxbin = bin;
+        }
+    }
+    for(int bin : bins)
+    {
+        size_t height = bin;
+        if (maxbin > 76){
+            size_t height = 76 * (static_cast<double>(bin) / maxbin);
+        }
+        if(10<=bin && bin<100){
+            cout << " " << bin << "|";
+        }
+        else if(bin<10){
+            cout << " " << " " << bin << "|";
+        }
+        else if(bin>100){
+            cout << bin << "|";
+        }
+        for(int i = 0; i < height; i++)
+        {
+            cout << "*";
+        }
+        cout << endl;
+    }
+    return 0;
+}
+}
 int main()
 {
+    auto in = input_data();
+    auto bins = make_histogram(in.numbers, in.bin_count);
+    show_histogram_text(bins, ...);
+
+    double min, max;
+    find_minmax(in.numbers, min, max);
     const size_t SCREEN_WIDTH = 80;
     const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1;
     size_t number_count, bin_count;