commit b05df353be50c7e5bbf25cab0af59cddc29d6fbf Author: ShchipkovMY Date: Sat Sep 9 13:03:03 2023 +0300 закоммитил файлы исходного кода diff --git a/lab_1.cbp b/lab_1.cbp new file mode 100644 index 0000000..d7c31ba --- /dev/null +++ b/lab_1.cbp @@ -0,0 +1,40 @@ + + + + + + diff --git a/main.cpp b/main.cpp new file mode 100644 index 0000000..2c3f59f --- /dev/null +++ b/main.cpp @@ -0,0 +1,106 @@ +#include +#include +#include + +using namespace std; + +int main() +{ + int i, j; + size_t number_count; + const size_t screen_width = 80; + const size_t max_asterisk = screen_width - 3 - 1; + + cerr << "Enter number count : "; + cin >> number_count; + vector numbers(number_count); + cerr << "Enter numbers : " << endl; + for (i = 0; i < number_count; i++) + { + cin >> 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]; + 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]++; + } + } + + double max_count; + max_count = bins[0]; + for (i=0; i< bin_count; i++) + { + if (max_countmax_asterisk) + { + flag=true; + } + for (j = 0; j < bin_count; j++) + { + if (bins[j] < 100) + { + cout << " "; + } + if (bins[j] < 10) + { + cout << " "; + } + cout << bins[j] << "|"; + + if (flag) + { + height = max_asterisk * (static_cast(bins[j]) / max_count); + } + else + { + height=bins[j]; + } + for (i = 0; i < height; i++) + { + cout << "*"; + } + cout << endl; + } + _getch(); + return 0; +}