From baefcf8a625e2fd58dd47a043f1941d12247088f Mon Sep 17 00:00:00 2001
From: Aylana <PiapiyevaAV@mpei.ru>
Date: Fri, 4 Apr 2025 21:09:16 +0300
Subject: [PATCH] =?UTF-8?q?build:=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=BF=D1=80=D0=BE?=
 =?UTF-8?q?=D0=B5=D0=BA=D1=82=D0=B0?=
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..cb379f5
--- /dev/null
+++ b/main.cpp
@@ -0,0 +1,114 @@
+#include <iostream>
+#include <vector>
+using namespace std;
+
+int main()
+{
+    size_t numbers_count;
+    cerr << "Enter numbers count: ";
+    cin >> numbers_count;
+    vector<double> numbers(numbers_count);
+    cerr << "Enter numbers: ";
+
+    for (int i = 0; i < numbers_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;
+
+    for (size_t i = 0; i < numbers_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]++;
+            }
+    }
+
+    /*
+    cout << "Numbers: ";
+    for (int i=0;i<numbers_count;i++){
+        cout << numbers[i] << " ";
+    }
+    cout << "\n";
+    cout << "Bins: ";
+    for (int i=0;i<bin_count;i++){
+        cout << bins[i] << " ";
+    }
+    cout << "\n";
+
+    cout << numbers[0] << " ";
+    cout << bins[1];
+    */
+
+    size_t max_count = bins[0];
+
+    for (size_t x : bins) {
+        if (x > max_count) {
+            max_count = x;
+        }
+    }
+
+    /*if (max_count > 76) {
+        for (size_t i = 0; i < bin_count; i++) {
+            if (bins[i] == max_count) {
+                bins[i] = 76 * 1.0;
+            }
+            else {
+                bins[i] = 76 * (static_cast<double>(bins[i]) / max_count);
+            }
+        }
+    }*/
+
+
+    for (int i = 0; i < bin_count; i++) {
+        /*if ((bins[i] >= 100) && (bins[i] < 1000)){
+            cout << " " << bins[i] << "|";
+        }*/
+        if ((bins[i] >= 1) && (bins[i] < 10)){
+            cout << "  " << bins[i] << "|";
+        }
+        else if ((bins[i] >= 10) && (bins[i] < 100)){
+            cout << " " << bins[i] << "|";
+        }
+        else {
+            cout << bins[i] << "|";
+        }
+        if (max_count > 76) {
+                if (bins[i] == max_count) {
+                    bins[i] = 76 * 1.0;
+                }
+                else {
+                    bins[i] = 76 * (static_cast<double>(bins[i]) / max_count);
+                }
+        }
+        for (int j = 0;j < bins[i]; j++){
+            cout << "*";
+        }
+        cout << "\n";
+    }
+
+    return 0;
+}