From 85a7925da93cb401ee6db194c2214fc851fce148 Mon Sep 17 00:00:00 2001
From: "Alice (KharisovSR)" <kharisovSR@mpei.ru>
Date: Mon, 10 Apr 2023 10:49:37 +0300
Subject: [PATCH] code: main

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

diff --git a/main.cpp b/main.cpp
new file mode 100644
index 0000000..1a42f16
--- /dev/null
+++ b/main.cpp
@@ -0,0 +1,120 @@
+#include <iostream>
+#include <vector>
+
+using namespace std;
+
+int main()
+{
+    size_t number_count;//количество чисел
+    cerr<<"vvod chisel";
+    cin>>number_count;
+
+
+    vector <double> numbers(number_count);//вектор с количсетвом элементов number_count
+
+    cout<<endl;//заполнение вектора
+    for(size_t i=0; i<number_count; i++)
+    {
+        cin>>numbers[i];
+    }
+
+    size_t bin_count;//количество корзин
+    cin>>bin_count;
+    vector<size_t> bins(bin_count);
+
+    double min = numbers[0];//поиск мин
+    double max = numbers[0];//поиск макс
+    for (double x : numbers)//цикл дня всех елементов 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 < 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]++;
+        }
+    }
+
+    size_t max_count=0;//максимум элементов в корзине
+    for (size_t i =0; i<bin_count; i++)
+    {
+        if (max_count <bins[i])
+        {
+            max_count=bins[i];
+        }
+    }
+
+
+
+    int proc;
+    int sum =0;
+    for(size_t i=0; i<bin_count; i++)//вывод с процентами
+    {
+
+        if (i==bin_count-1)
+        {
+            proc=100-sum;
+        }
+        else
+        {
+            proc =((float)bins[i] / number_count)*100;
+        }
+
+        sum+=proc;
+
+        if (proc<10)//выравнивание с %
+        {
+            cout<<"  "<<proc<<"% | ";
+        }
+        if ((proc<100)&&(proc>=10))
+        {
+            cout<<" "<<proc<<"% | ";
+        }
+
+        size_t height = 0;
+
+        if (max_count>75)//маштабирование
+        {
+            size_t height = 75 * (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]-1; j++)
+            {
+
+                cout<<"*";
+            }
+        }
+
+        cout<<endl;
+    }
+}