#include #include #include #include using namespace std; struct Input { vector numbers; size_t bin_count{}; }; Input input_data(){ size_t number_count; cerr << "Enter number count: "; cin >> number_count; Input in; in.numbers.resize(number_count); cerr << "Enter numbers: " << endl; for (size_t i=0; i < number_count; i++) { cin >> in.numbers[i]; } in.bin_count; cerr << "Enter bin count: "; cin >> in.bin_count; return in; } void find_minmax(vector numbers, double& min, double& max){ min = numbers[0]; min = numbers[0]; for(size_t i=0; i < sizeof(numbers) / sizeof(numbers[0]); i++){ if (numbers[i] < min) { min = numbers[i]; } else if (numbers[i] > max) { max = numbers[i]; } } } int main() { const size_t MAX_ELEMENT = 76; Input in = input_data(); double min, max; find_minmax(in.numbers, min, max); vector bins(in.bin_count); double bin_size = (max - min) / in.bin_count; for (size_t i = 0; i < sizeof(in.numbers) / sizeof(in.numbers[0]); i++) { bool found = false; for (size_t j = 0; (j < in.bin_count - 1) && !found; j++) { auto lower_Bound = min + j * bin_size; auto upper_Bound = min + (j + 1) * bin_size; if ((lower_Bound <= in.numbers[i]) && (in.numbers[i] < upper_Bound)) { bins[j]++; found = true; } } if (!found) { bins[in.bin_count - 1]++; } } double max_count = bins[0]; for (size_t j=0; j < in.bin_count; j++){ if (bins[j] > max_count) { max_count = bins[j]; } } vector height(in.bin_count); for (size_t j=0; j < in.bin_count; j++){ height[j] = MAX_ELEMENT * (bins[j]/max_count); } if (max_count > MAX_ELEMENT){ for (size_t j=0; j < in.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 < in.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; } } }