From b4af8f2525fe443e7afc077d708dda4377bd9047 Mon Sep 17 00:00:00 2001
From: "Daniel (IvanovDA)" <IvanovDanAn@mpei.ru>
Date: Mon, 15 Apr 2024 14:08:56 +0300
Subject: [PATCH] =?UTF-8?q?code:=20=D0=B4=D0=BE=D0=B1=D0=B0=D0=B2=D0=BB?=
 =?UTF-8?q?=D0=B5=D0=BD=D0=B8=D0=B5=20=D1=84=D0=B0=D0=B9=D0=BB=D0=B0=20?=
 =?UTF-8?q?=D0=BF=D1=80=D0=BE=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

---
 lab1.cpp | 74 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 74 insertions(+)
 create mode 100644 lab1.cpp

diff --git a/lab1.cpp b/lab1.cpp
new file mode 100644
index 0000000..525beee
--- /dev/null
+++ b/lab1.cpp
@@ -0,0 +1,74 @@
+#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 amount of numbers \n";
+    cin >> number_count;
+    vector<double> numbers(number_count);
+    for (size_t i = 0; i < number_count; i++){
+        cerr << "Input number " << i+1 << endl;
+        cin >> numbers[i];
+    }
+    double minc, maxc;
+    minc = maxc = numbers[0];
+    for (size_t i = 1; i < number_count; i++ ){
+        if(numbers[i] < minc){
+            minc = numbers[i];
+        }
+        else if (numbers[i] > maxc){
+            maxc = numbers[i];
+        }
+    }
+    size_t bin_count;
+    cerr << "Input number of bins \n";
+    cin >> bin_count;
+    vector<size_t> bins(bin_count);
+    double bin_size = (maxc - minc) / bin_count;
+    size_t bin_max_size = 0;
+    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 = minc + j * bin_size;
+            auto hi = minc + (j + 1) * bin_size;
+            if ((lo <= numbers[i]) && (numbers[i] < hi)) {
+                bins[j]++;
+                found = true;
+                if (bins[j]> bin_max_size){
+                    bin_max_size = bins[j];
+                }
+            }
+        }
+        if (!found) {
+            bins[bin_count - 1]++;
+            if (bins[bin_count - 1]> bin_max_size){
+                    bin_max_size = bins[bin_count - 1];
+                }
+        }
+    }
+    double k = double(MAX_ASTERISK) / bin_max_size;
+    if (k>1){
+        k = 1;
+    }
+    // vector <size_t> bin_graph(bin_count);
+    // for (size_t bin = 0; bin < bin_count; bin++){
+    //     bin_graph[bin] = int(float (bins[bin]) * k);
+    // }
+    for (size_t bin = 0; bin < bin_count; bin++){
+        if (bins[bin] < 100){
+            cout << " ";
+        }
+        if (bins[bin] < 10){
+            cout << " ";
+        }
+        cout << bins[bin] << "|";
+        for (size_t i = 0; i < bin * k; i++){
+            cout << "*";
+        }
+        cout << endl;
+    }
+    return 0;
+}
\ No newline at end of file