From 3a56710e810bef69b24431e49938315647ab2e89 Mon Sep 17 00:00:00 2001
From: AnisenkovPD <pavean8205@gmail.com>
Date: Thu, 18 Apr 2024 21:35:12 +0300
Subject: [PATCH] code: lab01

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

diff --git a/main.cpp b/main.cpp
new file mode 100644
index 0000000..8d373d2
--- /dev/null
+++ b/main.cpp
@@ -0,0 +1,130 @@
+#include <iostream>
+#include <cmath>
+#include <vector>
+using namespace std;
+const size_t SCREEN_WIDTH = 80;
+const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1;
+
+int main()
+{
+    size_t number_count;
+    cerr << "Enter number count: ";
+    cin >> number_count;
+
+    vector<double> numbers(number_count);
+    cerr << "Enter numbers: ";
+    for(size_t i = 0; i < number_count; i++)
+    {
+        cin >> numbers[i];
+    }
+
+    size_t bin_count;
+
+    cerr << "Enter bin count: ";
+    cin >> bin_count;
+    int ef, ps=0;
+    if (bin_count==0)
+    {
+        ef=(sqrt(number_count));
+        if (ef>25)
+        {
+            ps=1+(log2(number_count));
+            cout<<"ps: " << ps<<endl;
+            bin_count=ps;
+        }
+        else{
+            cout<<"ef: " << ef<<endl;
+            bin_count=ef;
+        }
+    }
+    double min = numbers[0];
+    double max = numbers[0];
+    for (double x : numbers)
+    {
+        if (x < min)
+        {
+            min = x;
+        }
+        else if (x > max)
+        {
+            max = x;
+        }
+    }
+    vector<size_t> bins(bin_count);
+    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 ( (numbers[i] >= lo) && (numbers[i] < hi) )
+            {
+                bins[j]++;
+                found = true;
+            }
+        }
+        if (!found)
+        {
+            bins[bin_count-1]++;
+        }
+
+    }
+    size_t max_count = bins[0];
+    for(size_t x: bins)
+    {
+        if(x > max_count)
+        {
+            max_count = x;
+        }
+    }
+    if (max_count > MAX_ASTERISK)
+    {
+        for(size_t count: bins)
+        {
+            size_t height = MAX_ASTERISK * (static_cast<double>(count) /max_count);
+            if (count < 10)
+            {
+                cout << "  " << count << "|";
+            }
+            else if (count < 100)
+            {
+                cout << " " << count << "|";
+            }
+            else
+            {
+                cout << count << "|";
+            }
+            for(size_t i = 0; i < height; i++)
+            {
+                cout << "*";
+            }
+            cout << "\n";
+        }
+    }
+    else
+    {
+        for(size_t x : bins)
+        {
+            if (x < 10)
+            {
+                cout << "  " << x << "|";
+            }
+            else if (x < 100)
+            {
+                cout << " " << x << "|";
+            }
+            else
+            {
+                cout << x << "|";
+            }
+            for(size_t i = 0; i < x; i++)
+            {
+                cout << "*";
+            }
+            cout << "\n";
+        }
+    }
+    return 0;
+}