From bef88b1f50340040b9a8cb044f8635bb0fd64cc3 Mon Sep 17 00:00:00 2001
From: BobrovnikYA <BobrovnikYA@mpei.ru>
Date: Fri, 2 May 2025 09:52:35 +0300
Subject: [PATCH] =?UTF-8?q?code:=20=D0=B2=D1=8B=D0=BD=D0=B5=D1=81=D0=B5?=
 =?UTF-8?q?=D0=BD=D1=8B=20=D1=84=D1=83=D0=BD=D0=BA=D1=86=D0=B8=D0=B8=20?=
 =?UTF-8?q?=D0=B8=D0=B7=20=D0=BE=D1=81=D0=BD=D0=BE=D0=B2=D0=BD=D0=BE=D0=B3?=
 =?UTF-8?q?=D0=BE=20=D0=BA=D0=BE=D0=B4=D0=B0?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 lab01.cbp |   5 +++
 main.cpp  | 120 +++++++++++++++++-------------------------------------
 2 files changed, 43 insertions(+), 82 deletions(-)

diff --git a/lab01.cbp b/lab01.cbp
index d541ad7..81cae27 100644
--- a/lab01.cbp
+++ b/lab01.cbp
@@ -32,6 +32,11 @@
 			<Add option="-Wall" />
 			<Add option="-fexceptions" />
 		</Compiler>
+		<Unit filename=".gitignore" />
+		<Unit filename="histogram.cpp" />
+		<Unit filename="histogram.h">
+			<Option target="&lt;{~None~}&gt;" />
+		</Unit>
 		<Unit filename="main.cpp" />
 		<Extensions>
 			<lib_finder disable_auto="1" />
diff --git a/main.cpp b/main.cpp
index 690313b..ea8ec77 100644
--- a/main.cpp
+++ b/main.cpp
@@ -2,95 +2,51 @@
 #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);
-    for (size_t i = 0; i < number_count; i++)
-    {
-        cin >> numbers[i];
+int main(){
+    size_t number;
+    cout<<"Enter number count: ";
+    cin>> number;
+
+    vector <double> count(number);
+    cout<< "enter chicla";
+    for (int i=0;i<number;i++){
+        cin>>count[i];
     }
-    //ввод числа корзин
+
     size_t bin_count;
-    cerr << "Enter number bin: ";
-    cin >> bin_count;
-    //инициализация массива корзин
-    vector<size_t> bins(bin_count);
-    //поиски экстремумов
-    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]++;
-        }
-    }
-    //выводы результатов
-    size_t max_count = bins[0];
-    for (size_t i = 0; i < bin_count; i++)
-    {
-        if (bins[i] > max_count) {
-            max_count = bins[i];
-        }
+    cout<<"Enter number bin_count: ";
+    cin>> bin_count;
+
+    vector <size_t>  bins(bin_count);
+
+    double max=count[0];
+    for (size_t i=0;i<number; i++){
+        if(count[i]> max){
+                max=count[i];
+           }
     }
 
-    for (size_t i = 0; i < bin_count; i++)
-    {
-        if (bins[i]<10) {
-            cout << "  " << bins[i] << "|";
-            }
-        else if (bins[i]<100) {
-            cout << " " << bins[i] << "|";
-        }
-        else if (bins[i]<1000) {
-            cout << bins[i] << "|";
-        }
+    double min=count[0];
+    for (size_t i=0;i<number; i++){
+        if(count[i]<min){
+                min=count[i];
+           }
+    }
 
-        size_t height;
+    double bin_size = (max-min)/bin_count;
 
-        if (max_count<=MAX_ASTERISK) {
-            height = bins[i];
+    for(size_t i = 0; i<number; 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<=count[i])&&(count[i]<hi)){
+                bins[j]++;
+                found=true;
+            }
         }
-        else {
-            height = MAX_ASTERISK * (static_cast<double>(bins[i]) / max_count);
+        if (!found){
+            bins[bin_count-1]++;
         }
-
-        for (size_t j = 0; j < height; j++) {
-            cout << "*";
-        }
-        cout << endl;
     }
-
-    return 0;
 }