From bd98bf3182f3de0c249f562e2e924e603e315b98 Mon Sep 17 00:00:00 2001
From: "Alice (KanishchevYA)" <KanishchevYA@mpei.ru>
Date: Tue, 6 Jun 2023 17:02:14 +0300
Subject: [PATCH] =?UTF-8?q?code:=20=D0=BD=D0=B0=D0=BD=D0=B0=D0=BB=D0=BE:?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

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

diff --git a/main.cpp b/main.cpp
new file mode 100644
index 0000000..4f0b6ac
--- /dev/null
+++ b/main.cpp
@@ -0,0 +1,66 @@
+#include <iostream>
+#include <vector>
+#include <conio.h>
+
+using namespace std;
+
+
+
+
+int main()
+{
+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;
+min = numbers[0];
+for (size_t i = 1; i < numbers.size(); i++)
+    if (numbers[i] < min)
+        min = numbers[i];
+
+
+double max;
+max = numbers[0];
+for (size_t i = 1; i < numbers.size(); i++)
+    if (numbers[i] > max)
+        max = numbers[i];
+
+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 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]++;
+    }
+}
+
+for (size_t i=0; i<bins.size(); i++)
+    {cout << bins[i] << "|";
+    for (size_t j=0; j<bins[i]; j++)
+        cout << "*";
+    cout << "\n" ;
+}
+
+    return 0;
+}