Вы не можете выбрать более 25 тем Темы должны начинаться с буквы или цифры, могут содержать дефисы(-) и должны содержать не более 35 символов.

124 строки
3.1 KiB
C++

#include <iostream>
#include <vector>
using namespace std;
struct Input {
vector<double> numbers;
size_t bin_count {};
};
Input input_data()
{
size_t number_count;
cerr << "Enter number count = ";
cin >> number_count;
Input in;
in.numbers.resize(number_count);
for (int i = 0; i < number_count; i++)
{
cin >> in.numbers[i];
}
cerr << "Vvedite bin_count = ";
cin >> in.bin_count;
return in;
}
int main() {
Input in = input_data();
for (int i = 0; i < in.numbers.size(); i++) {
if (numbers[i] < minimum)
minimum = numbers[i];
if (numbers[i] > maximum)
maximum = numbers[i];
}
double bin_size = (maximum - minimum) / bin_count;
LL = minimum;
LR = minimum + bin_size;
for (int i = 0; i < bin_count; i++) {
if (i == 0) {
for (int b = 0; b < number_count; b++) {
if ((LL <= numbers[b]) && (numbers[b] < LR))
bins[i] += 1;
}
LL = LR;
LR = LL + bin_size;
}
if (i == (bin_count - 1)) {
LR = maximum;
for (int b = 0; b < number_count; b++) {
if ((LL < numbers[b]) && (numbers[b] <= LR))
bins[i] += 1;
}
break;
}
if ((i != 0) && (i != (bin_count - 1))) {
for (int b = 0; b < number_count; b++) {
if ((LL < numbers[b]) && (numbers[b] < LR))
bins[i] += 1;
}
LL = LR;
LR = LL + bin_size;
}
}
const size_t SCREEN_WIDTH = 80;
const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1;
max_count = 0;
for (int i = 0; i < bin_count; i++) {
if (bins[i] > max_count)
max_count = bins[i];
}
for (int i = 0; i < bin_count; i++) {
if ((i + 1) < bin_count)
he_next = bins[i + 1];
else
he_next = -1;
if (bins[i] < 10) {
cout << " ";
}
if (bins[i] < 100) {
cout << " ";
}
cout << bins[i] << "|";
if (max_count > 76) {
height = MAX_ASTERISK * (static_cast<double>(bins[i]) / max_count);
if ((i+1) < bin_count)
he2_next = MAX_ASTERISK * (static_cast<double>(bins[i + 1]) / max_count);
else
he2_next = -1;
for (int b = 0; b < height; b++) {
if (b == he2_previous)
cout << "^";
if (b == he2_next)
cout << "˅";
if ((b != (he2_previous - 1)) && (b != (he2_next - 1)))
cout << "*";
}
he2_previous = height;
}
else {
for (int b = 0; b < bins[i]; b++) {
if (b == (he_previous-1))
cout << "^";
if (b == (he_next - 1))
cout << "v";
if ((b != (he_previous - 1)) && (b != (he_next - 1)))
cout << "*";
}
}
cout << endl;
he_previous = bins[i];
}
return 0;
}