commit ed1d3a38c3b0f5bf262c6a978d9e5e4f5195b36a Author: Dmitri (Krivov) Date: Sun May 4 18:10:54 2025 +0300 The original code diff --git a/lab01.cbp b/lab01.cbp new file mode 100644 index 0000000..5f11f48 --- /dev/null +++ b/lab01.cbp @@ -0,0 +1,38 @@ + + + + + + diff --git a/main.cpp b/main.cpp new file mode 100644 index 0000000..34dd0b3 --- /dev/null +++ b/main.cpp @@ -0,0 +1,98 @@ +#include +#include + +using namespace std; + +const size_t SCREEN_WIDTH = 80; +const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1; + +void printspace (int number) +{ + if (number < 10) cout << " "; + else if (number < 100) cout << " "; +} + +int main() +{ + size_t number_count; + cerr << "enter number count: "; + cin >> number_count; + + vector numbers(number_count); + for (size_t i=0; i> numbers[i]; + } + size_t bin_count; + 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; + + size_t max_count = 0; + + 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]++; + if (bins[j] > max_count) + { + max_count = bins[j]; + } + found = true; + } + } + if (!found) + { + bins[bin_count - 1]++; + } + } + + if (max_count <= 76) + { + for (size_t i = 0; i < bin_count; i++) + { + printspace(bins[i]); + cout << bins[i] << "|"; + for (size_t j = 0; j < bins[i]; j++) + { + cout << "*"; + } + cout << endl; + } + } + else + { + for (size_t i = 0; i < bin_count; i++){ + size_t height = 76 * (static_cast(bins[i]) / max_count); + printSpace(bins[i]); + cout << bins[i] << "|"; + for (size_t j = 0; j < height; j++) + { + cout << "*"; + } + cout << endl; +}