From 7f8f5a5e9b91bf36531ca03fc895804bc27b30e0 Mon Sep 17 00:00:00 2001
From: ZelenkinaKM <ZelenkinaKM@mpei.ru>
Date: Wed, 10 Apr 2024 14:23:24 +0300
Subject: [PATCH] =?UTF-8?q?code:=20=D0=B8=D1=81=D1=85=D0=BE=D0=B4=D0=BD?=
 =?UTF-8?q?=D1=8B=D0=B9=20=D0=BA=D0=BE=D0=B4?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

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

diff --git a/main.cpp b/main.cpp
new file mode 100644
index 0000000..593ff7d
--- /dev/null
+++ b/main.cpp
@@ -0,0 +1,97 @@
+#include <iostream>
+#include <vector>
+
+using namespace std;
+
+int main()
+{
+    const size_t SCREEN_WIDTH = 80;
+    const size_t MAX_ASTERISK = SCREEN_WIDTH - 3-1;
+    //Количество чисел
+
+    size_t number_count;
+    cerr<<"Enter number count: ";
+    cin>>number_count;
+    vector<double>numbers(number_count);
+
+    //Числа
+    cerr<<"Enter elements: ";
+    for (int i=0; i<number_count;i++){
+        cin>>numbers[i];
+    }
+
+
+
+
+    //Количество корзин
+    size_t bin_count;
+    cerr<<"Enter bins count: ";
+    cin>>bin_count;
+    vector<size_t>bins(bin_count);
+
+    //Определение диапазона чисел (max и min) в массиве
+    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<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]++;
+        }
+    }
+
+
+    //Максимальное кол-во звездочек
+    int max_simb=0;
+    for (int i=0; i<bin_count;i++){
+        int c=0;
+        c=bins[i];
+        if (max_simb<c){
+            max_simb=c;
+        }
+    }
+
+       if (max_simb > MAX_ASTERISK){
+        vector<size_t> hights(bin_count);
+        for (size_t i = 0; i < bin_count; i++){
+            size_t height = MAX_ASTERISK * (static_cast<double>(bins[i]) / max_simb);
+            hights[i] = height;
+            printf("%3d|", bins[i]);
+            for (int j=0; j<(hights[i]); j++){
+                cout<<"*";
+            }
+            cout<<endl;
+        }
+
+       }
+        else{
+        for (int i=0; i<bin_count; i++){
+        printf("%3d|", bins[i]);
+            for (int j=0; j<bins[i]; j++){
+                cout<<"*";
+            }
+            cout<<endl;
+        }
+       }
+
+    return 0;
+}