From b1f93d945443789d25726e7a68db7dd444ceea60 Mon Sep 17 00:00:00 2001 From: grudininyk Date: Sun, 28 Apr 2024 23:54:24 +0300 Subject: [PATCH] =?UTF-8?q?code:=20=D0=B2=D1=8B=D0=B2=D0=BE=D0=B4=20=D0=B3?= =?UTF-8?q?=D0=B8=D1=81=D1=82=D1=80=D0=BE=D0=B3=D1=80=D0=B0=D0=BC=D0=BC?= =?UTF-8?q?=D1=8B?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- .gitignore | 5 ++ main.cpp | 131 ++++++++++++++++++++++++++++++++++++----------------- 2 files changed, 95 insertions(+), 41 deletions(-) create mode 100644 .gitignore diff --git a/.gitignore b/.gitignore new file mode 100644 index 0000000..c9adeb5 --- /dev/null +++ b/.gitignore @@ -0,0 +1,5 @@ +/bin +/obj +/*.layout +/*.depend +/*.o diff --git a/main.cpp b/main.cpp index e442e18..985134d 100644 --- a/main.cpp +++ b/main.cpp @@ -2,71 +2,120 @@ #include 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; - size_t max_count = 0; - cerr << "Enter number count:"; + cerr << "Enter number count: "; cin >> number_count; - vector numbers(number_count); - cerr << "Enter numbers:"; - for (int i = 0; i < number_count; i++) { - cin >> numbers[i]; + Input in; + in.numbers.resize(number_count); + for (size_t i = 0; i < number_count; i++) + { + cin >> in.numbers[i]; } + cerr << "Enter bin count: "; + cin >> in.bin_count; + return in; +} - - size_t bin_count; - cerr << "Enter bin count:"; - cin >> bin_count; - vector bins(bin_count); - double min = numbers[0]; - double max = numbers[0]; - for (double x : numbers) { - if (x < min) { - min = x; - } - else if (x > max) { +void +find_minmax(const vector& numbers, double& min, double& max) +{ + min = numbers[0]; + max = numbers[0]; + for (double x : numbers) + { + if (x > max ) + { max = x; } + if (x < min) + { + min = x; + } } - double bin_size = (max - min) / bin_count; - for (size_t i = 0; i < number_count; i++) { +} + +vector +make_histogram(const vector& numbers, size_t& bin_count) +{ + double min = 0; + double max = 0; + find_minmax(numbers, min, max); + auto bin_size = (max - min)/bin_count; + vector bins(bin_count); + for (double number : numbers) + { bool found = false; - for (size_t j = 0; (j < bin_count - 1) && !found; j++) { + 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)) { + if ((lo <= number) && (number < hi)) + { bins[j]++; found = true; } } - if (!found) { + if (!found) + { bins[bin_count - 1]++; } - for (size_t i = 0; i < bin_count; i++) { - if (bins[i] > max_count) { - max_count = bins[i]; - } - } } - double kof = double(MAX_ASTERISK) / max_count; - if (kof > 1) { - kof = 1; + return bins; +} + +void +show_histogram_text(const vector& bins, size_t& bin_count) { + const size_t SCREEN_WIDTH = 80; + const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1; + size_t max_count = 0; + for (size_t s = 0; s < bin_count; s++) + { + if (bins[s] > max_count) + { + max_count = bins[s]; + } } - for (size_t bin : bins) { - if (bin < 100) { + for (size_t bin : bins) + { + if (bin <100) + { cout << " "; } - if (bin < 10) { + if (bin <10) + { cout << " "; } cout << bin << "|"; - for (size_t i = 0; i < size_t(bin * kof); i++) { - cout << "*"; + if (max_count > MAX_ASTERISK) + { + size_t count = bin; + size_t height = MAX_ASTERISK * (static_cast(count) / max_count); + for (size_t t = 0; t < height; t++) + { + cout << "*"; + } } - + else for (size_t k = 0; k < bin; k++) + { + cout << "*"; + } cout << endl; } - return 0; +} + +int main() +{ + Input in = input_data(); + vector bins = make_histogram(in.numbers, in.bin_count); + show_histogram_text(bins, in.bin_count); }