commit 68af9391a35f69e6638e75a37371707922fb76da Author: MordashovSA Date: Sun May 4 16:52:11 2025 +0300 add lab01 diff --git a/lab01.cbp b/lab01.cbp new file mode 100644 index 0000000..d541ad7 --- /dev/null +++ b/lab01.cbp @@ -0,0 +1,40 @@ + + + + + + diff --git a/main.cpp b/main.cpp new file mode 100644 index 0000000..198f571 --- /dev/null +++ b/main.cpp @@ -0,0 +1,96 @@ +#include +#include + +using namespace std; +int main() +{ + const size_t SCREEN_WIDTH = 80; + const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1; + //ввод числа элементов массива + size_t number_count; + cerr << "Enter number count: "; + cin >> number_count; + //инициализация массива чисел и заполнение + vector numbers(number_count); + for (size_t i = 0; i < number_count; i++) + { + cin >> numbers[i]; + } + //ввод числа корзин + size_t bin_count; + cerr << "Enter number bin: "; + 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]++; + } + } + //выводы результатов + size_t max_count = bins[0]; + for (size_t i = 0; i < bin_count; i++) + { + if (bins[i] > max_count) { + max_count = bins[i]; + } + } + + for (size_t i = 0; i < bin_count; i++) + { + if (bins[i]<10) { + cout << " " << bins[i] << "|"; + } + else if (bins[i]<100) { + cout << " " << bins[i] << "|"; + } + else if (bins[i]<1000) { + cout << bins[i] << "|"; + } + + size_t height; + + if (max_count<=MAX_ASTERISK) { + height = bins[i]; + } + else { + height = MAX_ASTERISK * (static_cast(bins[i]) / max_count); + } + + for (size_t j = 0; j < height; j++) { + cout << "*"; + } + cout << endl; + } + + return 0; +}