From 315b09ad7bcfd05f8c6de68a6e8ccca6a34bd48d Mon Sep 17 00:00:00 2001 From: AndrosovDS Date: Mon, 28 Apr 2025 09:55:31 +0300 Subject: [PATCH] =?UTF-8?q?code:=20=D0=B8=D1=81=D1=85=D0=BE=D0=B4=D0=BD?= =?UTF-8?q?=D1=8B=D0=B9=20=D0=BA=D0=BE=D0=B4?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- main.cpp | 85 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 85 insertions(+) create mode 100644 main.cpp diff --git a/main.cpp b/main.cpp new file mode 100644 index 0000000..d78c654 --- /dev/null +++ b/main.cpp @@ -0,0 +1,85 @@ +#include +#include + + +using namespace std; + +int main() +{ + const size_t SCREEN_WIDTH = 80; + const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1; + + + int number_count, bucket; + + do + { + cout << "Enter number count: "; cin >> number_count; + } + while (number_count < 1); + + do + { + cout << "Enter bucket: "; cin >> bucket; + } + while (bucket < 1); + + cout << "\n"; + + vector numbers(number_count); + for (int i = 0; i < number_count; i++) cin >> numbers[i]; + + float min = numbers[0]; + float max = numbers[0]; + + for (float x : numbers) + { + if (x < min) min = x; + else if (x > max) max = x; + } + + float k = (max-min)/bucket; + + vector stolb(bucket); + + for (int j = 0; j < bucket; j++) stolb[j] = 0; + + for (int i = 0; i < number_count; i++) + { + bool flag = false; + for (int j = 0; (j < bucket && !flag); j++) + { + if (numbers[i] >= (min+k*j) && numbers[i] < (min+k*(1+j))) + { + stolb[j]++; + flag = true; + + } + } + if (!flag) stolb[bucket-1]++; + } + + int maxlen = 0; + + for (int j = 0; j < bucket; j++) + { + if (maxlen MAX_ASTERISK) + { + if (maxlen != stolb[j]) height = MAX_ASTERISK * (static_cast(stolb[j])/maxlen); + else if (maxlen == stolb[j]) height = MAX_ASTERISK; + } + for (int i = 0; i < height; i++) cout << "*"; + cout << "\n"; + } + + return 0; +}