Вы не можете выбрать более 25 тем
Темы должны начинаться с буквы или цифры, могут содержать дефисы(-) и должны содержать не более 35 символов.
133 строки
2.7 KiB
C++
133 строки
2.7 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;
|
|
cin >> number_count;
|
|
Input in;
|
|
in.numbers.resize(number_count);
|
|
for (size_t i = 0; i < number_count; i++) {
|
|
cin >> in.numbers[i];
|
|
}
|
|
cin >> in.bin_count;
|
|
return in;
|
|
}
|
|
|
|
void find_minmax(const vector<double>& numbers, double& min, double& max) {
|
|
min = numbers[0];
|
|
for (double x : numbers){
|
|
if (x < min){
|
|
min = x;
|
|
}
|
|
if (x > max){
|
|
max = x;
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
int main()
|
|
{
|
|
Input in = input_data();
|
|
|
|
setlocale(LC_ALL, "rus");
|
|
size_t number_count;
|
|
cin >> number_count;
|
|
|
|
vector<double> numbers(number_count);
|
|
for (size_t i = 0; i < number_count; i++) {
|
|
cin >> numbers[i];
|
|
}
|
|
|
|
size_t bin_count;
|
|
cin >> bin_count;
|
|
|
|
vector <size_t> bins(bin_count);
|
|
|
|
double min = numbers[0];
|
|
double max = numbers[0];
|
|
find_minmax(in.numbers, min, max);
|
|
cerr<<min;
|
|
cerr<<max;
|
|
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]++;
|
|
}
|
|
}
|
|
|
|
size_t Maxbins = 0;
|
|
|
|
|
|
for (size_t i = 0; i < bin_count; i++)
|
|
{
|
|
if (bins[i] > Maxbins)
|
|
{
|
|
Maxbins = bins[i];
|
|
}
|
|
}
|
|
|
|
const size_t MAX_HEIGHT = 76;
|
|
double min1 = min;
|
|
if (Maxbins <= MAX_HEIGHT)
|
|
{
|
|
for (size_t i = 0; i < bin_count; i++)
|
|
{
|
|
if (bins[i] < 10)
|
|
{
|
|
cout << " ";
|
|
}
|
|
cout << " " << bins[i] << "|";
|
|
for (size_t j = 0; j < bins[i]; j++)
|
|
{
|
|
cout << "*";
|
|
}
|
|
cout << endl;
|
|
}
|
|
}
|
|
else
|
|
{
|
|
for (size_t i = 0; i < bin_count; i++)
|
|
{
|
|
size_t height = static_cast <size_t> (MAX_HEIGHT * (static_cast<double>(bins[i]) / Maxbins));
|
|
|
|
if (bins[i] < 100)
|
|
{
|
|
cout << " ";
|
|
}
|
|
if (bins[i] < 10)
|
|
{
|
|
cout << " ";
|
|
}
|
|
cout << bins[i] << "|";
|
|
for (size_t j = 0; j < height; j++)
|
|
{
|
|
cout << "*";
|
|
}
|
|
cout << endl;
|
|
}
|
|
}
|
|
return 0;
|
|
}
|