From 808154186a096272f74322c1ffdd689afcfb42aa Mon Sep 17 00:00:00 2001
From: MokeevNV <MokeevNV@mpei.ru>
Date: Thu, 24 Apr 2025 14:34:53 +0300
Subject: [PATCH] =?UTF-8?q?code:=201.=D0=BA=D0=BE=D0=B4=20lab01?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

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

diff --git a/main.cpp b/main.cpp
new file mode 100644
index 0000000..38c7407
--- /dev/null
+++ b/main.cpp
@@ -0,0 +1,82 @@
+#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<double> numbers(number_count);
+    for (size_t i = 0;i<number_count;i++) {
+        cin >> numbers[i];
+    }
+    //ввод количества корзин
+    size_t bin_count;
+    cerr << "Enter bin count: ";
+    cin >> bin_count;
+    //определение наибольшего и минимального числа
+    vector<size_t> bins(bin_count);
+    double min = numbers[0];
+    double max = numbers[0];
+    for (double x : numbers) {
+        if (x < min) {
+            min = x;
+        }
+        else if (x > max) {
+            max = x;
+        }
+    }
+    //разница между границами
+    double bin_size = (max - min) / bin_count;
+    //распределение чисел по корзинам и поиск максимального количества чисел в корзине
+    size_t max_count = 0;
+    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]++;
+                if (bins[j] > max_count) {
+                    max_count = bins[j];
+                }
+                found = true;
+            }
+        }
+        if (!found) {
+                bins[bin_count-1]++;
+                if (bins[bin_count - 1] > max_count) {
+                        max_count = bins[bin_count - 1];
+                }
+        }
+    }
+    //вывод
+    for (size_t i = 0;i < bin_count;i++){
+        if (bins[i] < 100){
+            cout << " ";
+        }
+        if (bins[i] < 10){
+            cout << " ";
+        }
+        cout << bins[i] << "|";
+        if (max_count > MAX_ASTERISK){
+            size_t height = MAX_ASTERISK * (static_cast<double>(bins[i]) / max_count);
+            for (size_t j = 0;j < height;j++){
+                cout << "*";
+            }
+        }
+        else{
+            for (size_t j = 0;j < bins[i];j++){
+                cout << "*";
+            }
+        }
+        cout << endl;
+    }
+    return 0;
+}