From 55100acfd74e44ec230d1a7586f151f5a7c27322 Mon Sep 17 00:00:00 2001 From: MokeevNV Date: Thu, 24 Apr 2025 23:40:57 +0300 Subject: [PATCH] =?UTF-8?q?code:=202.c=D1=82=D1=80=D1=83=D0=BA=D1=82=D1=83?= =?UTF-8?q?=D1=80=D0=B8=D1=80=D0=BE=D0=B2=D0=B0=D0=BD=D0=B8=D0=B5=20=D0=BF?= =?UTF-8?q?=D1=80=D0=BE=D0=B3=D1=80=D0=B0=D0=BC=D0=BC=D1=8B=20=D0=BF=D1=80?= =?UTF-8?q?=D0=B8=20=D0=BF=D0=BE=D0=BC=D0=BE=D1=89=D0=B8=20=D1=84=D1=83?= =?UTF-8?q?=D0=BD=D0=BA=D1=86=D0=B8=D0=B9?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- main.cpp | 74 +++++++++++++++++++++++++++++++++++++------------------- 1 file changed, 49 insertions(+), 25 deletions(-) diff --git a/main.cpp b/main.cpp index 38c7407..168b61f 100644 --- a/main.cpp +++ b/main.cpp @@ -3,27 +3,33 @@ using namespace std; -int main() { - //константы для масштабирования - const size_t SCREEN_WIDTH = 80; - const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1; +struct Input { + vector numbers; + size_t bin_count{}; +}; + +Input input_data() { //ввод количества чисел size_t number_count; cerr << "Enter number count: "; cin >> number_count; + //переменная-экземпляр + Input in; //ввод чисел - vector numbers(number_count); - for (size_t i = 0;i> 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 bin count: "; - cin >> bin_count; - //определение наибольшего и минимального числа - vector bins(bin_count); - double min = numbers[0]; - double max = numbers[0]; + cin >> in.bin_count; + return in; +} + + //определение наибольшего и минимального числа +void find_minmax(const vector& numbers, double& min, double& max) { + min = numbers[0]; + max = numbers[0]; for (double x : numbers) { if (x < min) { min = x; @@ -32,32 +38,45 @@ int main() { max = x; } } +} + +vector make_histogram(const vector &numbers, size_t &bin_count) { + vector bins(bin_count); + double min,max; + find_minmax(numbers , min , max); //разница между границами double bin_size = (max - min) / bin_count; - //распределение чисел по корзинам и поиск максимального количества чисел в корзине - size_t max_count = 0; - for (size_t i = 0; i < number_count; i++) { + //распределение чисел по корзинам + for (size_t i = 0; i < numbers.size(); 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]++; - if (bins[j] > max_count) { - max_count = bins[j]; - } found = true; } } if (!found) { bins[bin_count-1]++; - if (bins[bin_count - 1] > max_count) { - max_count = bins[bin_count - 1]; - } } } + return bins; +} + +void show_histogram_text(const vector &bins){ + //поиск максимального количества чисел в корзине + size_t max_count = 0; + for (double x : bins){ + if (x > max_count){ + max_count = x; + } + } + //константы для масштабирования + const size_t SCREEN_WIDTH = 80; + const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1; //вывод - for (size_t i = 0;i < bin_count;i++){ + for (size_t i = 0;i < bins.size();i++){ if (bins[i] < 100){ cout << " "; } @@ -77,6 +96,11 @@ int main() { } } cout << endl; - } - return 0; + } +} + +int main() { + auto in = input_data(); + auto bins = make_histogram(in.numbers, in.bin_count); + show_histogram_text(bins); }