cs-lab34/main.cpp

#include <iostream>
#include <vector>

using namespace std;

const int max_length = 80;  // ìàêñèìàëüíàÿ äëèíà
const int indent = 4;       // îòñòóï

int main()
{
    size_t number_count, bin_count;
    cerr << "Enter number count: ";
    cin >> number_count;                       // ââîä êîë-âà îöåíîê
    vector<double> numbers(number_count);
    cerr << "Enter numbers: " << endl;
    for (int i = 0; i < number_count; i++) {
        cin >> numbers[i];                     // ââîä îöåíîê
    }
    cerr << "Enter bin count: ";
    cin >> bin_count;                          // ââîä êîë-âà êîðçèí
    vector<size_t> bins(bin_count);
    for (int i = 0; i < bin_count; i++) {
        bins[i] = 0;
    }
    double min = 5;
    double max = 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; // îïðåäåëåíèå ðàçìåðà êîðçèíû è øàãà
    double step = bin_size;

    for (int i = 0; i < number_count; i++) {
        bool found = false;                                    // óñëîâèå âõîæäåíèÿ â êàêîé-ëèáî ïðîìåæóòîê, êðîìå ïîñëåäíåãî
        for (int j = 0; (j < bin_count - 1) && !found; j++) {
            double lo = min + j * bin_size;                    // íèæíÿÿ ãðàíèöà ïðîìåæóòêà
            double hi = min + (j + 1) * bin_size;              // âåðõíÿÿ ãðàíèöà ïðîìåæóòêà
            if ((lo <= numbers[i]) && (numbers[i] < hi)) {     // ïðîâåðêà óñëîâèÿ âõîæäåíèÿ ÷èñëà â ïðîìåæóòîê
                bins[j]++;
                found = true;
            }
        }
        if (!found) {
            bins[bin_count - 1]++;
        }
    }

    double max_bin = bins[0];
    int k;
    for (int i = 0; i < bin_count; i++) {             // íàõîæäåíèå ìàêñ çíà÷åíèÿ bin[]
        if (bins[i] > max_bin) {
            max_bin = bins[i];
        }
    }
    if (max_bin <= (max_length - indent)) {           // ñðàâíåíèå äëèíû ñòðîêè "*" ñ ìàêñèìàëüíîé äëèíîé âûâîäèìîé ñòðîêè
        k = 0;
    }
    else {
        k = 1;
    }

    cerr << endl;
    int out;
    for (int i = 0; i < bin_count; i++) {
        cout.width(3);                                          // âûðàâíèâàíèå
        cout.fill(' ');
        cout << bins[i] << "|";
        if (k == 0) {                                           // ìàñøòàáèðîâàíèå
            out = bins[i];                                      // îáû÷íûé âûâîä
        }
        else {
            out = bins[i] * (max_length - indent) / max_bin;    // ìàñøòàáèðîâàííûé âûâîä
        }
        for (int j = 0; j < out; j++) {
            cout << "*";
        }
        cout << endl;
    }
    return 0;
}