From 5b6c152554ad8195dd45e8c1c20d16b172b3c9e3 Mon Sep 17 00:00:00 2001
From: Tanya <TsvetkovaTA@mpei.ru>
Date: Sat, 4 May 2024 14:49:08 +0300
Subject: [PATCH] =?UTF-8?q?code:=20=20=D0=BD=D0=B0=D1=87=D0=B0=D0=BB=D1=8C?=
 =?UTF-8?q?=D0=BD=D0=B0=D1=8F=20=D0=B2=D0=B5=D1=80=D1=81=D0=B8=D1=8F=20?=
 =?UTF-8?q?=D0=BA=D0=BE=D0=B4=D0=B0?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 main.cpp | 85 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 85 insertions(+)
 create mode 100644 main.cpp

diff --git a/main.cpp b/main.cpp
new file mode 100644
index 0000000..0b5e269
--- /dev/null
+++ b/main.cpp
@@ -0,0 +1,85 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+
+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<double> numbers(number_count);
+		cerr << "Enter numbers ";
+		for (int i = 0; i < number_count;i++) {
+			cin >> numbers[i];
+
+		}
+		size_t bin_count;
+		cerr << "Enter bin count ";
+		cin >> bin_count;
+
+		vector<size_t> bins(bin_count);
+		double max = numbers[0];
+		double min = numbers[0];
+		for (int i = 0; i < number_count;i++) {
+			if (numbers[i] > max)
+				max = numbers[i];
+			if (numbers[i] < min)
+				min = numbers[i];
+		}
+
+		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 maxb = 0;
+		for (int i = 0;i < bin_count;i++) {
+			if (bins[i] > maxb) {
+				maxb = bins[i];
+
+			}
+
+		}
+		double k = double(MAX_ASTERISK) / maxb;
+		if (k > 1) {
+			k = 1;
+
+		}
+		vector<size_t> bin_graph(bin_count);
+		for (size_t bin = 0; bin < bin_count; bin++) {
+			bin_graph[bin] = int(double(bins[bin] * k));
+
+		}
+		for (size_t i = 0; i < bin_count; i++) {
+			if (bins[i] < 100) {
+				cout << " ";
+			}
+			if (bins[i] < 10) {
+				cout << " ";
+			}
+			cout << bins[i] << '|';
+			for (size_t j = 0;j < bin_graph[i];j++) {
+				cout << "*";
+
+			}
+			cout << endl;
+
+		}
+
+
+	return 0;
+}