From 159f604094a8ee61dc4c48134397a90cf761b782 Mon Sep 17 00:00:00 2001 From: "Egor (Starikov)" Date: Mon, 3 Apr 2023 14:58:50 +0300 Subject: [PATCH] =?UTF-8?q?=D0=BA=D0=BE=D0=BC=D0=BC=D0=B8=D1=82=20=D0=BA?= =?UTF-8?q?=D0=BE=D0=B4=20=D0=BB=D0=B0=D0=B1=D0=B0=201?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- code.cbp | 40 +++++++++++++++++ code.cpp | 131 +++++++++++++++++++++++++++++++++++++++++++++++++++++++ 2 files changed, 171 insertions(+) create mode 100644 code.cbp create mode 100644 code.cpp diff --git a/code.cbp b/code.cbp new file mode 100644 index 0000000..941a5f3 --- /dev/null +++ b/code.cbp @@ -0,0 +1,40 @@ + + + + + + diff --git a/code.cpp b/code.cpp new file mode 100644 index 0000000..02bfd1c --- /dev/null +++ b/code.cpp @@ -0,0 +1,131 @@ +//ВАРИАНТ 4 +#include +#include + +using namespace std; + +int main() +{ + size_t number_count;//количество чисел + cerr<<"Kol-vo chisel -> "; + cin>>number_count; + + + vector numbers(number_count);//вектор с количсетвом эл. number_count + + cerr<<"Vvedite chisla:"; + cout<>numbers[i]; + //cout< "; + cin>>bin_count; + vector bins(bin_count); + + + double min = numbers[0];//поиск мин и макс + double max = numbers[0]; + for (double x : numbers) + { + if (x < min) + { + min = x; + } + else if (x > max) + { + 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]++; + } + } + + + + /* cout<=10)) + { + cout<<" "<76)//маштабирование + { + size_t height = 76 * (static_cast(bins[i]) / max_count); + for(size_t j=0; j<=height; j++) + { + + cout<<"*"; + } + } + else + { + for(size_t j=0; j<=bins[i]-1; j++) + { + + cout<<"*"; + } + } + + + + cout<