From 015ac0519f9a101f537e4ca5a3b9b46f4bfa9c9d Mon Sep 17 00:00:00 2001
From: LatyshevGI <LatyshevGI@mpei.ru>
Date: Fri, 25 Apr 2025 11:28:06 +0300
Subject: [PATCH] =?UTF-8?q?git:=20=D0=B4=D0=BE=D0=B1=D0=B0=D0=B2=D0=BB?=
 =?UTF-8?q?=D0=B5=D0=BD=20=D1=84=D0=B0=D0=B9=D0=BB=20=D0=B8=D1=81=D1=85?=
 =?UTF-8?q?=D0=BE=D0=B4=D0=BD=D0=BE=D0=B3=D0=BE=20=D0=BA=D0=BE=D0=B4=D0=B0?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

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

diff --git a/main.cpp b/main.cpp
new file mode 100644
index 0000000..d263508
--- /dev/null
+++ b/main.cpp
@@ -0,0 +1,128 @@
+#include <iostream>
+#include <vector>
+
+using namespace std;
+
+int main() {
+
+    size_t number_count, bin_count;
+    double min, max, bin_size;
+
+
+    cerr << "Enter the number of elements: ";
+    cin >> number_count;
+
+    vector<double> numbers(number_count);
+
+    cerr << "\nEnter " << number_count << " elements:" << endl;
+    for (size_t i = 0; i < number_count; i++) {
+        cin >> numbers[i];
+    }
+
+
+    cerr << "Enter the number of bins: ";
+    cin >> bin_count;
+
+    min = numbers[0];
+    max = numbers[0];
+    for (double x : numbers) {
+        if (x < min) {
+            min = x;
+        } else {
+            if (x > max) {
+                max = x;
+            }
+        }
+    }
+
+    bin_size = (max - min) / bin_count;
+
+    vector<size_t> bins(bin_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 ((numbers[i] >= lo) && (numbers[i] <= hi)) {
+                bins[j]++;
+                found = true;
+            }
+        }
+        if (!found) {
+            bins[bin_count - 1]++;
+        }
+    }
+
+    size_t max_count = bins[0];
+    for (size_t i = 1; i < bin_count; i++) {
+        if (bins[i] > max_count) {
+            max_count = bins[i];
+        }
+    }
+
+    const size_t SCREEN_WIDTH = 80;
+    const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1;
+
+
+    short space_count;
+
+    cerr << "\nHistogram:" << endl;
+
+    if (max_count <= MAX_ASTERISK) {
+        for (size_t i = 0; i < bin_count; i++) {
+            if (bins[i] < 10) {
+                space_count = 2;
+            } else if (bins[i] >= 10 && bins[i] < 100) {
+                space_count = 1;
+            } else if (bins[i] >= 100 && bins[i] < 1000) {
+                space_count = 0;
+            }
+
+
+
+            for (size_t k = 0; k < space_count; k++) {
+                cout << " ";
+            }
+
+            cout << bins[i];
+
+            cout << "|";
+
+
+            for (size_t j = 0; j < bins[i]; j++) {
+                cout << "*";
+            }
+
+            cout << "\n";
+        }
+    } else {
+        for (size_t i = 0; i < bin_count; i++) {
+            if (bins[i] < 10) {
+                space_count = 2;
+            } else if (bins[i] >= 10 && bins[i] < 100) {
+                space_count = 1;
+            } else if (bins[i] >= 100 && bins[i] < 1000) {
+                space_count = 0;
+            }
+
+
+            for (size_t k = 0; k < space_count; k++) {
+                cout << " ";
+            }
+
+            cout << bins[i];
+
+            cout << "|";
+
+            size_t height = static_cast<size_t>(MAX_ASTERISK * (static_cast<double>(bins[i]) / max_count));
+            for (size_t j = 0; j < height; j++) {
+                cout << "*";
+            }
+
+            cout << "\n";
+        }
+    }
+
+    return 0;
+}