From 92a689e77796aadc9aaa1b1943f21f7dc9bbdb37 Mon Sep 17 00:00:00 2001 From: FilippovaYI Date: Sun, 5 May 2024 23:08:17 +0300 Subject: [PATCH] build: main.cpp --- main.cpp | 92 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 92 insertions(+) create mode 100644 main.cpp diff --git a/main.cpp b/main.cpp new file mode 100644 index 0000000..5ce2862 --- /dev/null +++ b/main.cpp @@ -0,0 +1,92 @@ +#include +#include +using namespace std; +const size_t SCREEN_WIDTH = 80; +const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1; +int main() +{ + size_t number_count; + cerr << "Enter number count: "; + cin >> number_count; + + vector numbers(number_count); + cerr << "Enter numbers: "; + for(size_t i = 0; i < number_count; i++){ + cin >> numbers[i]; + } + + size_t bin_count; + cerr << "Enter bin count: "; + cin >> bin_count; + + double min = numbers[0]; + double max = numbers[0]; + /* + for (size_t x : numbers) { + if (x < min) { + min = x; + } + else if (x > max) { + max = x; + } + } + */ + for (size_t i=1; imax){ + max=numbers[i]; + } + } + vector bins(bin_count); + 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 ( (numbers[i] >= lo) && (numbers[i] < hi) ) { + bins[j]++; + found = true; + } + } + if (!found) { + bins[bin_count-1]++; + } + + } + size_t max_count = bins[0]; + for(size_t x: bins){ + if(x > max_count){ + max_count = x; + } + } + vector heights(bin_count); + if (max_count>MAX_ASTERISK){ + for (size_t i = 0; i < bin_count; i++){ + heights[i] = MAX_ASTERISK * (static_cast(bins[i]) /max_count); + } + } + else{ + for (size_t i=0; i