From b76cd0884e8aaa59b58e0af0faaf776166aeb463 Mon Sep 17 00:00:00 2001
From: AulovaAV <AulovaAV@mpei.ru>
Date: Sun, 28 May 2023 14:37:55 +0300
Subject: [PATCH] =?UTF-8?q?code:=20=D0=BA=D0=BE=D0=B4=20=D0=BF=D1=80=D0=BE?=
 =?UTF-8?q?=D0=B3=D1=80=D0=B0=D0=BC=D0=BC=D1=8B?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

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

diff --git a/main.cpp b/main.cpp
new file mode 100644
index 0000000..fd8a076
--- /dev/null
+++ b/main.cpp
@@ -0,0 +1,60 @@
+#include <iostream>
+#include <vector>
+using namespace std;
+int main()
+{
+size_t number_count;
+cout << "Enter number count: ";
+cin >> number_count;
+vector<double> numbers(number_count);
+for(int i=0; i<number_count; i++){
+cout << "numbers["<<i<<"]=";
+cin >> numbers[i];
+}
+size_t bin_count;
+cout<< "Enter bin count: ";
+cin>> 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;
+}
+}
+vector <size_t> bins(bin_count);
+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]++;}
+}
+ float procent;
+    for(size_t i=0; i<bin_count; i++)
+    {
+
+        int procent =(bins[i] / number_count)*100;
+
+        cout<<endl;
+
+        cout<<procent<<"%| ";
+        for(size_t j=0; j<=bins[i]-1; j++)
+        {
+
+            cout<<"*";
+        }
+        cout<<endl;
+    }
+
+return 0;
+}