From 48ce0d73e4bd8c18f760281a6b3a7cb51c5f66b4 Mon Sep 17 00:00:00 2001 From: KirsanovES Date: Mon, 10 Apr 2023 10:13:18 +0300 Subject: [PATCH] =?UTF-8?q?code:=20=D0=B4=D0=BE=D0=B1=D0=B0=D0=B2=D0=BB?= =?UTF-8?q?=D0=B5=D0=BD=20=D0=BA=D0=BE=D0=B4=201-=D0=BE=D0=B9=20=D0=BB?= =?UTF-8?q?=D0=B0=D0=B1=D1=8B?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- lab3.cbp | 40 ++++++++++++++++++++++++++++++++++++++++ main.cpp | 49 +++++++++++++++++++++++++++++++++++++++++++++++++ 2 files changed, 89 insertions(+) create mode 100644 lab3.cbp create mode 100644 main.cpp diff --git a/lab3.cbp b/lab3.cbp new file mode 100644 index 0000000..f103d77 --- /dev/null +++ b/lab3.cbp @@ -0,0 +1,40 @@ + + + + + + diff --git a/main.cpp b/main.cpp new file mode 100644 index 0000000..54cf48b --- /dev/null +++ b/main.cpp @@ -0,0 +1,49 @@ +#include +#include +using namespace std; + +int main() +{ + size_t number_count,bin_count; + double min,max; + cout<<"Enter number count: "; + cin>>number_count; + vector numbers(number_count); + for (size_t i=0;i>numbers[i]; + } + cout<<"Enter bin count: "; + cin>>bin_count; + max=numbers[0]; + min=numbers[0]; + for (double x : numbers) { + if (x < min) { + min = x; + } + else if (x > max) { + max = x; + } +} + double bin_size = (max - min) / bin_count; + vector bins(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]++; + } + for(size_t i=0;i