From 364387aa08a5da2a6b04054d376fb9775440f0e5 Mon Sep 17 00:00:00 2001 From: "Vitaliy (SamashovVV)" Date: Sun, 23 Apr 2023 17:59:58 +0300 Subject: [PATCH] =?UTF-8?q?code:=D0=B1=D0=B0=D0=B7=D0=BE=D0=B2=D1=8B=D0=B9?= =?UTF-8?q?=20=D0=BA=D0=BE=D0=B4?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- main.cpp | 103 +++++++++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 103 insertions(+) create mode 100644 main.cpp diff --git a/main.cpp b/main.cpp new file mode 100644 index 0000000..97fde50 --- /dev/null +++ b/main.cpp @@ -0,0 +1,103 @@ +#include +#include +#include +using namespace std; +int main() +{ + size_t count, bin_count; + + size_t i, j; + float min, max, bin_size; + float low, hi; + cerr << "Count= "; + cin >> count; + cerr << "Bin_count= "; + cin >> bin_count; + vectornumbers(count); + vectorbins(bin_count); + for (i = 0; i < count; i++) + { + cin >> numbers[i]; + } + min = numbers[0]; + max = numbers[0]; + for (i = 0; i < count; i++) + { + if (numbers[i] > max) + max = numbers[i]; + if (numbers[i] < min) + min = numbers[i]; + } + bin_size = (max - min) / bin_count; + low = min; + hi = low + bin_size; + for ( i = 0; i < count; i++) + { + bool found = false; + for (j = 0; (j < bin_count -1) && !found; j++) + { + low = min + j * bin_size; + hi = min + (j + 1) * bin_size; + if ((low <= numbers[i]) && (numbers[i] < hi)) + { + bins[j]++; + found = true; + } + } + if (found==false) + { + bins[bin_count - 1]++; + } + } + + + size_t sum_bins=0; + for (size_t bin:bins) + { + sum_bins+=bin; + } + size_t sred_bin = sum_bins/bin_count; + + const size_t SCREEN_WIDTH = 80; + const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1; + + size_t max_bin=bins[0]; + for (size_t bin:bins) + if (bin>max_bin) + max_bin=bin; + for (size_t bin:bins) + { + int height = bin; + if (max_bin > MAX_ASTERISK) + { + height = MAX_ASTERISK * (static_cast(bin) / max_bin); + } + if (bin < 100) + cout << " "; + if (bin < 10) + cout << " "; + cout<sred_bin){ + for(size_t i=0; i