Вы не можете выбрать более 25 тем
Темы должны начинаться с буквы или цифры, могут содержать дефисы(-) и должны содержать не более 35 символов.
128 строки
2.9 KiB
C++
128 строки
2.9 KiB
C++
|
|
#include <vector>
|
|
#include <iostream>
|
|
#include <cstdio>
|
|
|
|
using namespace std;
|
|
struct Input {
|
|
vector<double> numbers;
|
|
size_t bin_count{};
|
|
};
|
|
|
|
void find_minmax(vector<double> numbers, double& min, double& max);
|
|
size_t maxBin(vector<size_t> bins);
|
|
vector<size_t> make_histogram(vector<double> numbers, size_t bin_count);
|
|
Input input_data();
|
|
void show_histogram_text(vector<size_t> bins , size_t bin_count);
|
|
const size_t SCREEN_WIDTH = 80;
|
|
const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1;
|
|
|
|
int main()
|
|
{
|
|
|
|
Input in = input_data();
|
|
vector<size_t> bins = make_histogram(in.numbers, in.bin_count);
|
|
show_histogram_text(bins, in.bin_count);
|
|
return 0;
|
|
}
|
|
|
|
size_t maxBin(vector<size_t> bins) {
|
|
size_t max = bins[0];
|
|
for (int i = 1; i < bins.size(); i++) {
|
|
if (max < bins[i]) {
|
|
max = bins[i];
|
|
}
|
|
}
|
|
return max;
|
|
}
|
|
void find_minmax(vector<double> numbers, double& min, double& max) {
|
|
min = numbers[0];
|
|
max = numbers[0];
|
|
for (double number : numbers) {
|
|
if (min > number) {
|
|
min = number;
|
|
}
|
|
if (max < number) {
|
|
max = number;
|
|
}
|
|
}
|
|
return;
|
|
}
|
|
|
|
|
|
Input input_data() {
|
|
Input input_struct;
|
|
size_t countOfNumbers;
|
|
cerr << "Input your count of numbers:\n";
|
|
cin >> countOfNumbers;
|
|
|
|
input_struct.numbers.resize(countOfNumbers);
|
|
|
|
cerr << "Input bin count:\n";
|
|
cin >> input_struct.bin_count;
|
|
cerr << "Input numbers:\n";
|
|
for (int i = 0; i < countOfNumbers; i++) {
|
|
cerr << i << ":" << endl;
|
|
cin >> input_struct.numbers[i];
|
|
}
|
|
cerr << endl;
|
|
return input_struct;
|
|
}
|
|
|
|
vector<size_t> make_histogram(vector<double> numbers, size_t bin_count)
|
|
{
|
|
double max;
|
|
double min;
|
|
vector<size_t> bins;
|
|
bins.resize(bin_count);
|
|
find_minmax(numbers, min, max);
|
|
double bin_size = (max - min) / bin_count;
|
|
for (size_t i = 0; i < numbers.size(); 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]) && (hi > numbers[i])) {
|
|
bins[j]++;
|
|
found = true;
|
|
}
|
|
}
|
|
if (!found) {
|
|
bins[bin_count - 1]++;
|
|
}
|
|
}
|
|
return bins;
|
|
}
|
|
void show_histogram_text(vector<size_t> bins , size_t bin_count) {
|
|
size_t maxCount = maxBin(bins);
|
|
size_t count_stars;
|
|
for (size_t i = 0; i < bin_count; i++) {
|
|
|
|
if (bins[i] < 100) {
|
|
cout << " ";
|
|
}
|
|
if (bins[i] < 10) {
|
|
cout << " ";
|
|
}
|
|
|
|
cout << bins[i];
|
|
cout << "|";
|
|
|
|
if (maxCount > MAX_ASTERISK) {
|
|
count_stars = MAX_ASTERISK * (static_cast<double>(bins[i]) / maxCount);
|
|
}
|
|
else {
|
|
count_stars = bins[i];
|
|
}
|
|
for (size_t i2 = 0; i2 < count_stars; i2++) {
|
|
cout << "*";
|
|
}
|
|
cout << endl;
|
|
|
|
|
|
}
|
|
}
|
|
|
|
|
|
|