From 3e9c0860c50bb4a0f10bf2582f4d47b88cea6b1f Mon Sep 17 00:00:00 2001 From: LedovskojMM Date: Sun, 23 Apr 2023 20:12:50 +0300 Subject: [PATCH] =?UTF-8?q?=D0=98=D1=81=D1=85=D0=BE=D0=B4=D0=BD=D1=8B?= =?UTF-8?q?=D0=B9=20=D0=BA=D0=BE=D0=B4?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- lab1.cbp | 38 +++++++++++++++++++++++++ main.cpp | 85 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++ 2 files changed, 123 insertions(+) create mode 100644 lab1.cbp create mode 100644 main.cpp diff --git a/lab1.cbp b/lab1.cbp new file mode 100644 index 0000000..722660e --- /dev/null +++ b/lab1.cbp @@ -0,0 +1,38 @@ + + + + + + diff --git a/main.cpp b/main.cpp new file mode 100644 index 0000000..b32d6ea --- /dev/null +++ b/main.cpp @@ -0,0 +1,85 @@ +#include +#include +using namespace std; + +int main() +{ + double n; + size_t number_count, bin_count; + cerr<<"Enter number cout:"; + cin>>number_count; + vector numbers(number_count); + for (int i =0;i>numbers[i]; + } + cerr<<"Enter bin_count"; + cin>>bin_count; + vector bins(bin_count); + double min = numbers[0]; + double max = numbers[0]; + for (double x : numbers){ + if (xmax){ + max=x; + } + } + double bin_size= (max-min)/bin_count; + for (size_t i = 0; i < number_count; i++) { + bool found = false; + for (size_t j = 0; (j < bin_count - 1) && !found; j++) { + auto lo = min + j * bin_size; + auto hi = min + (j + 1) * bin_size; + if ((lo <= numbers[i]) && (numbers[i] < hi)) { + bins[j]++; + found = true; + } + } + if (!found) { + bins[bin_count - 1]++; + } + } + size_t maxbin=0; + for (size_t i=0; i=76){ + size_t height= 76*(static_cast(count)/maxbin); + for (size_t j=0; j