From 302d8564ab937402176ca64bed217f5885b4b371 Mon Sep 17 00:00:00 2001
From: BykovDA <BykovDA@mpei.ru>
Date: Sun, 20 Apr 2025 17:00:05 +0300
Subject: [PATCH] =?UTF-8?q?=D0=BE=D1=82=D1=81=D0=BB=D0=B5=D0=B6=D0=B8?=
=?UTF-8?q?=D0=B2=D0=B0=D0=B5=D0=BC=D1=8B=D0=B9=20=D1=84=D0=B0=D0=B9=D0=BB?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit
---
main.cpp | 60 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++
1 file changed, 60 insertions(+)
create mode 100644 main.cpp
diff --git a/main.cpp b/main.cpp
new file mode 100644
index 0000000..4cf9e6c
--- /dev/null
+++ b/main.cpp
@@ -0,0 +1,60 @@
+#include <iostream>
+#include <vector>
+
+using namespace std;
+int main()
+{
+ size_t number_count;
+ cerr <<"enter number count: ";
+ cin >> number_count;
+
+ vector<double> numbers(number_count);
+ for( int i=0; i<number_count; i++){
+ cerr<<"enter number "<< i+1<<": ";
+ cin>>numbers[i];
+ }
+ size_t bin_count;
+ cerr <<"enter bin count : ";
+ cin >> bin_count;
+ vector<size_t> bins(bin_count);
+ double min=numbers[0];
+ double max=numbers[0];
+ for(double x : numbers){
+ if(x<min){
+ min=x;
+ }
+ 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]++;
+ }
+ }
+ for (size_t i = 0; i < number_count; i++)
+ {
+ for (size_t j = 0; j < bin_count; j++)
+ {
+ if (bins[j]> i)
+ {
+ cout << "*";
+ }
+ else
+ {
+ cout << " ";
+ }
+ }
+ cout << endl;
+ }
+ return 0;
+}