ggg

main.cpp

@@ -1,117 +1,66 @@
 #include <iostream>
 #include <vector>
+#include <conio.h>
 
 using namespace std;
 
-const size_t SCREEN_WIDTH = 80;
-const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1;
 
 
-double findMin(vector<double> values)
-{
-    double min;
-    min = values[0];
-    for (size_t i = 1; i < values.size(); i++)
-        if (values[i] < min)
-            min = values[i];
-    return min;
-}
 
-double findMax(vector<double> values)
+int main()
 {
-    double max;
+size_t number_count;
-    max = values[0];
-    for (size_t i = 1; i < values.size(); i++)
-        if (values[i] > max)
-            max = values[i];
-    return max;
-}
 
-size_t findMax(vector<size_t> values)
+cerr << "Enter number count: ";              //количество чисел
-{
+cin >> number_count;
-    size_t max;
-    max = values[0];
-    for (size_t i = 1; i < values.size(); i++)
-        if (values[i] > max)
-            max = values[i];
-    return max;
-}
 
-vector<size_t> GetCarts(vector<double> values, size_t cartsCount)
+vector<double> numbers(number_count);         //векток с числами
-{
+
-    vector<size_t> carts(cartsCount);
+for(size_t i=0; i < number_count; i++)       //заполнение вектора
-    double min = findMin(values);
+    cin >> numbers[i];
-    double max = findMax(values);
+
-    double step = (max - min) / cartsCount;
+size_t bin_count;                               //количество корзин
-    for (size_t i = 0; i < values.size(); i++)
+cerr << "Enter bin count: ";
-    {
+cin >> bin_count;
+
+vector<size_t> bins(bin_count);
+
+double min;
+min = numbers[0];
+for (size_t i = 1; i < numbers.size(); i++)
+    if (numbers[i] < min)
+        min = numbers[i];
+
+
+double max;
+max = numbers[0];
+for (size_t i = 1; i < numbers.size(); i++)
+    if (numbers[i] > max)
+        max = 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 < cartsCount - 1) && !found; j++)
+    for (size_t j = 0; (j < bin_count - 1) && !found; j++) {
-        {
+        auto lo = min + j * bin_size;
-            auto lo = min + j * step;
+        auto hi = min + (j + 1) * bin_size;
-            auto hi = min + (j + 1) * step;
+        if ((lo <= numbers[i]) && (numbers[i] < hi)) {
-            if ((lo <= values[i]) && (values[i] < hi))
+            bins[j]++;
-            {
-                carts[j]++;
             found = true;
         }
     }
-        if (!found)
+     if (!found) {
-            carts[cartsCount - 1]++;
+        bins[bin_count - 1]++;
     }
-    return carts;
 }
 
-vector<double> inputValues()
+for (size_t i=0; i<bins.size(); i++)
-{
+    {cout << bins[i] << "|";
-    size_t valuesLen;
+    for (size_t j=0; j<bins[i]; j++)
-    cin >> valuesLen;
-    vector<double> values(valuesLen);
-    for (size_t i = 0; i < valuesLen; i++)
-        cin >> values[i];
-    return values;
-}
-
-size_t inputCartsCount()
-{
-    size_t cartsCount;
-    cin >> cartsCount;
-    return cartsCount;
-}
-
-vector<size_t> ScaleCart(vector<size_t> carts, size_t max)
-{
-    if (max < MAX_ASTERISK)
-        max = MAX_ASTERISK;
-    vector<size_t> cartsScales(carts.size());
-    for (size_t i = 0; i < carts.size(); i++)
-        cartsScales[i] = MAX_ASTERISK * (static_cast<double>(carts[i]) / max);
-    return cartsScales;
-}
-
-void outputCarts(vector<size_t> carts)
-{
-    size_t max = findMax(carts);
-    vector<size_t> cartsScales = ScaleCart(carts, max);
-    for (size_t i = 0; i < carts.size(); i++)
-    {
-        if (carts[i] < 100)
-            cout << " ";
-        if (carts[i] < 10)
-            cout << " ";
-        cout << carts[i] << "|";
-        for (size_t j = 0; j < cartsScales[i]; j++)
         cout << "*";
-        cout << endl;
+    cout << "\n" ;
-    }
-
 }
 
-int main()
+    return 0;
-{
-    vector<double> values = inputValues();
-    size_t cartsCount = inputCartsCount();
-    vector<size_t> carts = GetCarts(values, cartsCount);
-    outputCarts(carts);
 }
-