commit de8337c8cbada4581da849caf71153d9973204bf Author: SavinSA Date: Sun Apr 21 19:13:45 2024 +0300 code: заготовка кода diff --git a/main.cpp b/main.cpp new file mode 100644 index 0000000..2c17ffd --- /dev/null +++ b/main.cpp @@ -0,0 +1,86 @@ +#include +#include +#include +using namespace std; +int main() { + const size_t WIDTH = 80; + const size_t MAX_ASTERISK = WIDTH - 3 - 1; + size_t i, j; + size_t number_count; + cerr << "insert number count: \n"; + cin >> number_count; + vector numbers(number_count); + cerr << "insert numbers: \n"; + for (i = 0; i < number_count; i++) { + cin >> numbers[i]; + } + size_t bin_count; + cerr << "insert bin count: \n"; + cin >> bin_count; + + vector bins(bin_count); + double min, max; + min = numbers[0]; + max = numbers[0]; + for (double x : numbers) { + if (x < min) { + min = x; + } + else if (x > max) { + max = x; + } + } + for (i = 0; i < number_count; i++) { + for (j = number_count - 1; j > i; j--) { + if (numbers[i] == numbers[j]) { + numbers.erase(numbers.begin() + j); + number_count = number_count - 1; + } + } + } + for (i = 0; i < number_count; i++) { + cout << numbers[i]; + } + cout << "\n"; + double bin_size = (max - min) / bin_count; + for (i = 0; i < number_count; i++) { + bool found = false; + for (j = 0; (j < bin_count && !found); j++) { + auto lo = min + j * bin_size; + auto hi = min + (j + 1) * bin_size; + if ((lo <= numbers[i]) && (hi > numbers[i])) { + bins[j]++; + found = true; + } + } + if (!found) { + bins[bin_count - 1]++; + } + } + + size_t maxcount = bins[0]; + for (size_t x : bins) { + if (x > maxcount) { + maxcount = x; + } + } + + size_t height = 0; + for (i = 0; i < bin_count; i++) { + if (bins[i] < 100) { + cout << " "; + } + if (bins[i] < 10) { + cout << " "; + } + cout << bins[i] << "|"; + if (maxcount > 76) { + height = MAX_ASTERISK * (static_cast(bins[i]) / maxcount); + } + for (j = 0; j < height; j++) { + cout << "*"; + } + cout << "\n"; + } + return 0; +} \ No newline at end of file