From eec23e79c1a48133b56708e8b0b26171f69d579e Mon Sep 17 00:00:00 2001
From: KapitonovMikA <KapitonovMikA@mpei.ru>
Date: Wed, 8 May 2024 05:20:48 +0300
Subject: [PATCH] =?UTF-8?q?code:=20=D0=9E=D0=B1=D0=BD=D0=BE=D0=B2=D0=BB?=
 =?UTF-8?q?=D1=91=D0=BD=D0=BD=D1=8B=D0=B9=20=D0=BA=D0=BE=D0=B4?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 main1.cpp | 105 ++++++++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 105 insertions(+)
 create mode 100644 main1.cpp

diff --git a/main1.cpp b/main1.cpp
new file mode 100644
index 0000000..1dd5179
--- /dev/null
+++ b/main1.cpp
@@ -0,0 +1,105 @@
+#include <iostream>
+#include <conio.h>
+#include <vector>
+#include <stdlib.h>
+using namespace std;
+
+int main()
+{
+    const size_t MAX_ELEMENT = 76;
+    size_t number_count;
+    cerr << "Enter number count: ";
+    cin >> number_count;
+
+    vector<double> numbers(number_count);
+    cerr << "Enter numbers: " << endl;
+    for (size_t i=0; i < number_count; i++)
+    {
+        cin >> numbers[i];
+    }
+
+    size_t bin_count;
+    cerr << "Enter bin count: ";
+    cin >> bin_count;
+
+    double min = numbers[0];
+    double max = numbers[0];
+    for(size_t i=0; i < number_count; i++){
+        if (numbers[i] < min)
+        {
+            min = numbers[i];
+        }
+        else if (numbers[i] > max)
+        {
+            max = numbers[i];
+        }
+    }
+
+    vector<size_t> bins(bin_count);
+    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 lower_Bound = min + j * bin_size;
+            auto upper_Bound = min + (j + 1) * bin_size;
+            if ((lower_Bound <= numbers[i]) && (numbers[i] < upper_Bound))
+            {
+                bins[j]++;
+                found = true;
+            }
+        }
+        if (!found)
+        {
+            bins[bin_count - 1]++;
+        }
+    }
+
+    double max_count = bins[0];
+    for (size_t j=0; j < bin_count; j++){
+        if (bins[j] > max_count) {
+            max_count = bins[j];
+        }
+    }
+    vector<size_t> height(bin_count);
+    for (size_t j=0; j < bin_count; j++){
+        height[j] = MAX_ELEMENT * (bins[j]/max_count);
+    }
+
+    if (max_count > MAX_ELEMENT){
+        for  (size_t j=0; j < bin_count; j++)
+            {
+                if (bins[j] < 100) {
+                    cout << " ";
+                    if (bins[j] < 10){
+                            cout << " ";
+                    }
+                }
+                cout << bins[j] << "|";
+
+                for (size_t i=0; i < height[j]; i++){
+                        cout << "*";
+                        }
+                cout << endl;
+            }
+    }
+    else {
+        for  (size_t j=0; j < bin_count; j++)
+            {
+                if (bins[j] < 100) {
+                    cout << " ";
+                    if (bins[j] < 10){
+                            cout << " ";
+                    }
+                }
+                cout << bins[j] << "|";
+
+                for (size_t i=0; i < bins[j];i++){
+                        cout << "*";
+                        }
+                cout << endl;
+            }
+    }
+}