#include #include using namespace std; struct Input { // Создание структуры vector numbers; size_t bin_count{}; }; Input input_data() { // Функция ввода //Создание переменных size_t number_count; Input in; // Ввод переменных cerr << "Enter number count: " << endl; cin >> number_count; in.numbers.resize(number_count); cerr << "Enter numbers: " << endl; for (int i = 0; i < number_count; i++) { cin >> in.numbers[i]; } cerr << "Enter bin count: " << endl; cin >> in.bin_count; return in; } void find_minmax(const vector& numbers, double& min_in_numbers, double& max_in_numbers) { min_in_numbers = numbers[0]; max_in_numbers = *(max_element(begin(numbers), end(numbers))); min_in_numbers = *(min_element(begin(numbers), end(numbers))); } int main() { // Константы const size_t SCREEN_WIDTH = 80; const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1; // Ввод данных через функцию Input in = input_data(); // Объявление перменных промежуточных/вывода vector bins(in.bin_count); double min_in_numbers, max_in_numbers; find_minmax(in.numbers, min_in_numbers, max_in_numbers); double bin_size = (max_in_numbers - min_in_numbers) / in.bin_count; int max_in_bins = 0; // Код for (size_t i = 0; i < in.numbers.size(); i++) { int to_bin = int((in.numbers[i]) - min_in_numbers) / bin_size; if (to_bin >= in.bin_count) { bins[to_bin - 1]++; } else { bins[to_bin]++; } } // Максимальное в коорзинах for (int i = 0; i < in.bin_count; i++) { if (bins[i] > max_in_bins) { max_in_bins = bins[i]; } } if (max_in_bins > MAX_ASTERISK) { for (int i = 0; i < in.bin_count; i++) { if (bins[i] < 100) { cout << " "; } if (bins[i] < 10) { cout << " "; } size_t height = MAX_ASTERISK * (static_cast(bins[i]) / max_in_bins); cout << bins[i] << "|"; for (int j = 0; j < height; j++) { cout << "*"; } cout << endl; } } else { // Если максимальное число среди коорзин меньше или равно 76 for (int i = 0; i < in.bin_count; i++) { if (bins[i] < 100) { cout << " "; } if (bins[i] < 10) { cout << " "; } cout << bins[i] << "|"; for (int j = 0; j < bins[i]; j++) { cout << "*"; } cout << endl; } } return 0; }