From d4884beb33e5e19da0eeeade3528a583a9407833 Mon Sep 17 00:00:00 2001
From: OvsiannikovRS <OvsiannikovRS@mpei.ru>
Date: Mon, 28 Apr 2025 04:12:48 +0300
Subject: [PATCH] =?UTF-8?q?code:=20=D0=BA=D0=BE=D0=B4=20=D1=80=D0=B0=D0=B7?=
 =?UTF-8?q?=D0=B1=D0=B8=D1=82=20=D0=BD=D0=B0=20=D1=84=D1=83=D0=BD=D0=BA?=
 =?UTF-8?q?=D1=86=D0=B8=D0=B8?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 LR3/main.cpp | 94 +++++++++++++++++++++++++---------------------------
 1 file changed, 45 insertions(+), 49 deletions(-)

diff --git a/LR3/main.cpp b/LR3/main.cpp
index 53db6d5..0e842d3 100644
--- a/LR3/main.cpp
+++ b/LR3/main.cpp
@@ -3,26 +3,29 @@
 
 using namespace std;
 
-int main()
-{
-    const size_t SCREEN_WIDTH = 80;
-    const size_t MAX_ASTERISK = SCREEN_WIDTH - 4;
 
+struct Input{
+vector<double> numbers;
+    size_t bin_count{};
+};
+
+Input
+input_data(){
+    Input in;
     size_t number_count;
-    cerr << "Enter number count:";
     cin >> number_count;
-    cerr << "Enter numbers" << "\n";
-    vector<double> numbers(number_count);
-    for(size_t i = 0; i < number_count; ++i){
-        cerr << i + 1 << ":";
-        cin >> numbers[i];
+    in.numbers.resize(number_count);
+    for (size_t i = 0; i < number_count; i++) {
+        cin >> in.numbers[i];
     }
-    size_t bin_count;
-    cerr << "Enter bins count:";
-    cin >> bin_count;
-    vector<size_t> bins(bin_count);
-    double min = numbers[0];
-    double max = numbers[0];
+    cin >> in.bin_count;
+    return in;
+}
+
+void
+find_minmax(vector<double> numbers, double& min, double& max) {
+    min = numbers[0];
+    max = numbers[0];
     for (double x : numbers) {
         if (x < min) {
             min = x;
@@ -31,53 +34,46 @@ int main()
             max = x;
         }
     }
-    size_t max_count = 0;
+}
+
+vector<size_t>
+make_histogram(vector<double> numbers, int bin_count){
+    vector<size_t> bins(bin_count);
+    double min = numbers[0];
+    double max = numbers[0];
+    find_minmax(numbers, min, max);
     double bin_size = (max - min) / bin_count;
-    for (size_t i = 0; i < number_count; i++) {
+    for (auto x: numbers) {
         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)) {
+            if ((lo <= x) && (x < hi)) {
                 bins[j]++;
                 found = true;
-
-            if(bins[j] > max_count) max_count = bins[j];
             }
         }
         if (!found) {
             bins[bin_count - 1]++;
-            if(bins[bin_count - 1] > max_count) max_count = bins[bin_count - 1];
         }
     }
-    if(max_count <= MAX_ASTERISK){
-        for(size_t count: bins){
-            if (count < 100) cout << " ";
-            if (count < 10) cout << " ";
-            cout << count << "|";
-            for(size_t i = 0; i < count; ++i) cout << "*";
-            cout << "\n";
-            }
-    }
-    else{
-        for(size_t count: bins){
-            if (count < 100) cout << " ";
-            if (count < 10) cout << " ";
-            cout << count << "|";
-
-        size_t height = MAX_ASTERISK * (static_cast<double>(count) / max_count);
-        for(size_t i = 0; i < height; ++i) cout << "*";
-            cout << "\n";
+    return bins;
+}
 
+void
+show_histogram_text(vector<size_t> bins){
+    for(size_t count: bins){
+        if (count < 100) cout << " ";
+        if (count < 10) cout << " ";
+        cout << count << "|";
+    for(size_t i = 0; i < count; ++i) cout << "*";
+        cout << "\n";
         }
-    }
-
-cout << "\n";
-for(size_t i = 0; i < max_count; ++i){
-    for(size_t j = 0; j < bin_count; ++j){
-        if(bins[j] > i) cout << "*";
-        else cout << " ";
-    }
-    cout << "\n";
 }
+
+int main()
+{
+    auto in = input_data();
+    auto bins = make_histogram(in.numbers, in.bin_count);
+    show_histogram_text(bins);
 }