From 2656f2e0976261a4e43bd2394e4f9f782a9317d0 Mon Sep 17 00:00:00 2001 From: KapitonovMikA Date: Wed, 8 May 2024 05:18:02 +0300 Subject: [PATCH] =?UTF-8?q?code:=20=D0=9E=D0=B1=D0=BD=D0=BE=D0=B2=D0=BB?= =?UTF-8?q?=D1=91=D0=BD=D0=BD=D1=8B=D0=B9=20=D0=BA=D0=BE=D0=B4?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- main.cpp | 130 ++++++++++++++++++++++++++++++------------------------- 1 file changed, 70 insertions(+), 60 deletions(-) diff --git a/main.cpp b/main.cpp index 85477f4..1dd5179 100644 --- a/main.cpp +++ b/main.cpp @@ -1,51 +1,51 @@ #include #include #include +#include using namespace std; + int main() { - const size_t SCREEN_WIDTH = 80; - const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1; - int i, j; - double num; - size_t number_count, bin_count; - cerr << "Enter number count: " << "\n"; + const size_t MAX_ELEMENT = 76; + size_t number_count; + cerr << "Enter number count: "; cin >> number_count; + vector numbers(number_count); - for (i = 0; i < number_count; i++) + cerr << "Enter numbers: " << endl; + for (size_t i=0; i < number_count; i++) { - cin >> num; - numbers[i] = num; + cin >> numbers[i]; } - cerr << "Enter bin count: " << "\n"; + + size_t bin_count; + cerr << "Enter bin count: "; cin >> bin_count; - vector bins(bin_count); - for (i = 0; i < bin_count; i++) - { - bins[i] = 0; - } - double min_number = numbers[0]; - double max_number = numbers[0]; - for (double x : numbers) - { - if (x < min_number) + + double min = numbers[0]; + double max = numbers[0]; + for(size_t i=0; i < number_count; i++){ + if (numbers[i] < min) { - min_number = x; + min = numbers[i]; } - else if (x > max_number) + else if (numbers[i] > max) { - max_number = x; + max = numbers[i]; } } - double bin_size = (max_number - min_number) / bin_count; + + vector 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_number + j * bin_size; - auto hi = min_number + (j + 1) * bin_size; - if ((lo <= numbers[i]) && (numbers[i] < hi)) + auto lower_Bound = min + j * bin_size; + auto upper_Bound = min + (j + 1) * bin_size; + if ((lower_Bound <= numbers[i]) && (numbers[i] < upper_Bound)) { bins[j]++; found = true; @@ -56,40 +56,50 @@ int main() bins[bin_count - 1]++; } } - size_t max_bin_capacity = bins[0]; - for (size_t x : bins) - { - if (x > max_bin_capacity) - { - max_bin_capacity = x; + + double max_count = bins[0]; + for (size_t j=0; j < bin_count; j++){ + if (bins[j] > max_count) { + max_count = bins[j]; } } - size_t height = 0; - for (i = 0; i < bin_count; i++) - { - if (bins[i] < 10) - { - cout << " " << bins[i] << "|"; - } - if ((bins[i] < 100) && (bins[i] > 9)) - { - cout << " " << bins[i] << "|"; - } - if (bins[i] >= 100) - { - cout << bins[i] << "|"; - } - if (bins[i] > 76){ - height = MAX_ASTERISK * (static_cast(bins[i]) / max_bin_capacity); - } - if (bins[i] < 76) { - height = bins[i]; - } - for (j = 0; j < height; j++) - { - cout << "*"; - } - cout << "\n"; + vector height(bin_count); + for (size_t j=0; j < bin_count; j++){ + height[j] = MAX_ELEMENT * (bins[j]/max_count); + } + + if (max_count > MAX_ELEMENT){ + for (size_t j=0; j < bin_count; j++) + { + if (bins[j] < 100) { + cout << " "; + if (bins[j] < 10){ + cout << " "; + } + } + cout << bins[j] << "|"; + + for (size_t i=0; i < height[j]; i++){ + cout << "*"; + } + cout << endl; + } + } + else { + for (size_t j=0; j < bin_count; j++) + { + if (bins[j] < 100) { + cout << " "; + if (bins[j] < 10){ + cout << " "; + } + } + cout << bins[j] << "|"; + + for (size_t i=0; i < bins[j];i++){ + cout << "*"; + } + cout << endl; + } } - return 0; }