From 8da017c5dc0123c181cf2aca4223f45d9acf96bf Mon Sep 17 00:00:00 2001
From: "Artem(KislovAG)" <kislovartem12@gmail.com>
Date: Mon, 3 Apr 2023 14:01:13 +0300
Subject: [PATCH] =?UTF-8?q?code:=20=D0=B8=D1=81=D1=85=D0=BE=D0=B4=D0=BD?=
 =?UTF-8?q?=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

---
 main.cpp | 114 +++++++++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 114 insertions(+)
 create mode 100644 main.cpp

diff --git a/main.cpp b/main.cpp
new file mode 100644
index 0000000..c58b7df
--- /dev/null
+++ b/main.cpp
@@ -0,0 +1,114 @@
+#include <iostream>
+#include <vector>
+using namespace std;
+
+int main()
+{
+    const size_t SCREEN_WIDTH = 80;
+    const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1;
+
+
+    size_t number_count;
+    cerr << "Enter number count: ";
+    cin >> number_count;
+    vector < float > numbers(number_count);
+    for(size_t i = 0; i < number_count; i++){
+        cerr << "Enter number: ";
+        cin >> numbers[i];
+    }
+    size_t bin_count;
+    cerr << "Enter counts of been: ";
+    cin >> bin_count;
+    vector < size_t > bins(bin_count);
+    float max1 = numbers[0];
+    float min1 = numbers[0];
+    for (size_t i = 0; i < number_count; i++){
+        if (numbers[i] > max1){
+            max1 = numbers[i];
+        }
+        if (numbers[i] < min1 ){
+            min1 = numbers[i];
+        }
+    }
+    float bin_size = (max1 - min1) / 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 = min1 + j * bin_size;
+            auto hi = min1 + (j + 1) * bin_size;
+            if ( (lo <= numbers[i]) && (numbers[i] < hi) ){
+                bins[j]++;
+                found = true;
+            }
+        }
+        if (!found){
+            bins[bin_count - 1]++;
+        }
+    }
+
+
+    int maxbin = 0;
+    //определение максимальной кoрзины
+        for (int j = 0; j < bin_count; j++){
+            if (bins[j] > maxbin){
+                maxbin = bins[j];
+            }
+        }
+    int flag = 0;
+    if (maxbin > MAX_ASTERISK){
+        flag = 1;
+    }
+
+    for (size_t j = 0; j < bin_count; j++){
+        size_t height = 0;
+        //выравнивание
+        if (bins[j] < 100){
+            cout << " ";
+        }
+        if (bins[j] < 10){
+            cout << " ";
+        }
+        cout << bins [j];
+
+        cout << "|";
+        if (flag == 1){
+        height = MAX_ASTERISK * (static_cast<double>(bins[j]) / maxbin);
+            for (size_t k = 0; k < height; k++){
+                cout << "*";
+            }
+        cout << endl;
+        }
+        if (flag == 0){
+            for (size_t n = 0; n < bins[j]; n++){
+            cout << "*";
+        }
+
+        cout << endl;
+
+        }
+    }
+
+
+// VARIANT
+//    float max_bin = bins[0];
+//    for (size_t j = 0; j < bin_count; j++){
+//        if (bins[j] > max_bin){
+//            max_bin = bins[j];
+//        }
+//    }
+//
+//    for (size_t i = 0; i < max_bin; i++){
+//        for (size_t j = 0; j < bin_count; j++){
+//            if(bins[j] > i){
+//                cout << "*";
+//            }
+//            else{
+//                cout << "";
+//            }
+//        }
+//    cout << endl;
+//    }
+
+
+    return 0;
+}