From 60ef80327c0f4316f18254087172e8ab3cfc127e Mon Sep 17 00:00:00 2001
From: MakhnovGA <makhnovga@mpei.ru>
Date: Wed, 19 Apr 2023 21:59:33 +0300
Subject: [PATCH] =?UTF-8?q?code:=20=D0=B8=D0=B7=D0=BC=D0=B5=D0=BD=D0=B5?=
 =?UTF-8?q?=D0=BD=D0=B8=D0=B5=20=D0=BA=D0=BE=D0=B4=D0=B0=20=D0=B4=D0=BE=20?=
 =?UTF-8?q?=D0=BF=D1=83=D0=BD=D0=BA=D1=82=D0=B0=204?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .gitignore |  2 ++
 main.cpp   | 76 +++++++++++++++++++++++++++++++++++++++++-------------
 2 files changed, 60 insertions(+), 18 deletions(-)
 create mode 100644 .gitignore

diff --git a/.gitignore b/.gitignore
new file mode 100644
index 0000000..0a079b6
--- /dev/null
+++ b/.gitignore
@@ -0,0 +1,2 @@
+/bin
+/obj
\ No newline at end of file
diff --git a/main.cpp b/main.cpp
index 75b6324..292129f 100644
--- a/main.cpp
+++ b/main.cpp
@@ -4,31 +4,48 @@
 #include <vector>
 using namespace std;
 
-int main() {
-    size_t numbersCount;
-    cerr << "Numbers count ==>"; cin >> numbersCount;
-    vector<size_t> numbers(numbersCount);
+struct Input {
+    vector<double> numbers;
+    size_t bin_count{};
+};
 
-    size_t i, j, min, max;
-    cerr << "Numbers ==>";
-    for (i = 0; i < numbersCount; i++)
-        cin >> numbers[i];
-    size_t binCount;
-    cerr << "Bin count ==>"; cin >> binCount;
-    vector<size_t> bins(binCount);
+Input
+input_data(){
+    cerr << "Input numbers count: ";
+    size_t number_count;
+    cin >> number_count;
+    Input in;
+    in.numbers.resize(number_count);
+    cerr << "Input numbers: ";
+    for (size_t i = 0; i < number_count; i++) {
+        cin >> in.numbers[i];
+    }
+    cerr << "Input bin count: ";
+    cin >> in.bin_count;
+    return in;
+}
 
+void
+find_minmax(vector<double> numbers, double &min, double &max) {
     min = numbers[0];
     max = numbers[0];
-    for (i = 1; i < numbersCount; i++) {
+    for (size_t i = 1; i < numbers.size(); i++) {
         if (min > numbers[i])
             min = numbers[i];
         if (max < numbers[i])
             max = numbers[i];
     }
-    double binSize = (max - min) / (float) binCount;
-    for (i = 0; i < numbersCount; i++) {
+    return;
+}
+
+vector <size_t> make_histogramm(vector<double>numbers, size_t bin_count){
+    double min, max;
+    find_minmax(numbers, min, max);
+    double binSize = (max - min) / bin_count;
+    vector<size_t> bins(bin_count);
+    for (size_t i = 0; i < numbers.size(); i++) {
         bool found = false;
-        for (j = 0; (j < binCount - 1) && !found; j++) {
+        for (size_t j = 0; (j <= bin_count - 1) && !found; j++) {
             auto lo = min + j * binSize;
             auto hi = min + (j + 1) * binSize;
             if ((numbers[i] >= lo) && (numbers[i] < hi)) {
@@ -37,13 +54,36 @@ int main() {
             }
         }
         if (!found)
-            bins[binCount - 1]++;
+            bins[bin_count - 1]++;
+    }
+    int max_count = bins[0];
+    for (size_t i = 0; i < bin_count; i++) {
+        if (bins[i] > max_count)
+            max_count = bins[i];
     }
-    for (i = 0; i < binCount; i++) {
+    if (max_count > 76) {
+        for (size_t i = 0; i < bin_count; i++) {
+            int count = bins[i];
+            size_t height = 76 * (static_cast<double>(count) / max_count);
+            bins[i] = height;
+        }
+    }
+    return bins;
+}
+
+void show_histogramm(vector<size_t>bins){
+    for (size_t i = 0; i < bins.size(); i++) {
         cout << bins[i] << "|";
-        for (j = 0; j < bins[i]; j++)
+        for (size_t j = 0; j < bins[i]; j++)
             cout << "*";
         cout << endl;
     }
+    return;
+}
+
+int main() {
+    Input in = input_data();
+    auto bins = make_histogramm(in.numbers, in.bin_count);
+    show_histogramm(bins);
     return 0;
 }