From 05bea8b565d2ac87e259c7c5186078709ba7f0d0 Mon Sep 17 00:00:00 2001 From: BezhenarAN Date: Tue, 23 Apr 2024 17:31:11 +0300 Subject: [PATCH] =?UTF-8?q?code:=D0=BF=D1=83=D0=BD=D0=BA=D1=82=203.1=20(?= =?UTF-8?q?=D0=A4=D1=83=D0=BD=D0=BA=D1=86=D0=B8=D1=8F=20=D1=80=D0=B0=D1=81?= =?UTF-8?q?=D1=81=D1=87=D0=B5=D1=82=D0=B0=20=D0=B3=D0=B8=D1=81=D1=82=D0=BE?= =?UTF-8?q?=D0=B3=D1=80=D0=B0=D0=BC=D0=BC=D1=8B)?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- main.cpp | 36 +++++++++++++++++++----------------- 1 file changed, 19 insertions(+), 17 deletions(-) diff --git a/main.cpp b/main.cpp index c8529f0..3472e06 100644 --- a/main.cpp +++ b/main.cpp @@ -45,33 +45,35 @@ void find_minmax(const vector &numbers, double &min, double &max){ } } -int main(){ - - Input in = input_data(); - - vector bins ( in.bin_count ); - double min = in.numbers[0]; - double max = in.numbers[0]; - - find_minmax(in.numbers, min, max); - - - double bin_size = ( max - min ) / in.bin_count; - for (size_t i=0; i < in.numbers.size(); i++ ){ +vector make_histogram(const vector &numbers, size_t bin_count) { + double min = numbers[0]; + double max = numbers[0]; + find_minmax(numbers, min, max); + double bin_size = ( max - min ) / bin_count; + vector bins ( bin_count ); + for (size_t i=0; i < numbers.size(); i++ ){ bool found = false; - for (size_t j = 0; ( j < in.bin_count - 1 ) && !found; j++ ){ + 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 <= in.numbers[i] && ( in.numbers[i] < hi )){ + if (lo <= numbers[i] && ( numbers[i] < hi )){ bins[j]++; found = true; } } if ( !found ){ - bins[in.bin_count-1]++; + bins[bin_count-1]++; } } - // + return bins; +} + +int main(){ + + Input in = input_data(); + + auto bins = make_histogram(in.numbers, in.bin_count); + size_t maxbin = bins[0]; for (size_t i=1; i < in.bin_count; i++){ if (maxbin < bins[i]){