Denis (ShestovDN) 2 лет назад
Родитель 266cd082bf
Сommit 8a4638ef32

@ -3,81 +3,131 @@
using namespace std;
int main()
struct Input
{
vector<double> numbers;
size_t bin_count{};
};
Input
input_data()
{
size_t number_count;
cerr << "number count="; cin>>number_count; // ââîä êîëè÷åñòâà ÷èñåë
cin >> number_count;
char l,r,v;
Input in;
vector<double> numbers(number_count);
in.numbers.resize(number_count);
for (size_t i = 0; i < number_count; i++)
{
cin >> in.numbers[i];
}
cin >> in.bin_count;
for (int i=0; i<number_count; i++)
return in;
}
void find_minmax(const vector<double>& numbers, double& min, double& max)
{
min = numbers[0];
for (auto i = 0; i < numbers.size(); i++)
{
cin>>numbers[i]; // ââîä ìàññèâà ÷èñåë
if (numbers[i] < min)
{
min = numbers[i];
}
}
size_t bin_count;
cerr<<"bin count="; cin>>bin_count; // ââîä êîëè÷åñòâà êîðçèí
vector<size_t> bins(bin_count); // ìàññèâ êàæäîé êîðçèíû
max = numbers[0];
for (auto i = 0; i < numbers.size(); i++)
{
if (numbers[i] > max)
{
max = numbers[i];
}
}
}
vector<size_t> make_histogram(const vector<double>& numbers, size_t bin_count)
{
double min = numbers[0];
double max = numbers[0];
for (double x : numbers) {
if (x < min) {
min = x;
}
else if (x > max) {
max = x;
}
}
vector<size_t> bins(bin_count);
vector<size_t> binss(bin_count);
double bin_size = (max - min) / bin_count; // ðàçìåð êàæäîé êîðçèíû
double max, min;
find_minmax(numbers, min, 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;
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]) && (numbers[i] < hi))
{
bins[j]++;
found = true;
}
}
if (!found)
{
bins[bin_count - 1]++;
}
}
if (!found)
int max_count = bins[0];
for (size_t i = 0; i < bin_count; i++)
{
if (bins[i] > max_count)
{
bins[bin_count - 1]++;
max_count = bins[i];
}
}
cout<<"risunok-";cin>>r;
cout<<"linia osi-";cin>>l;
cout<<"viravnivanie-";cin>>v;
if (max_count > 76)
{
for (size_t i = 0; i < bin_count; i++)
{
int count = bins[i];
size_t height = 76 * (static_cast<double>(count) / max_count);
bins[i] = height;
}
}
return bins;
}
void show_histogram_text(vector <size_t> bins, size_t bin_count )
{
for (int j=0; j<bin_count; j++)
for (size_t i = 0; i < bin_count; i++)
{
if(bins[j]<100)
cout<<v<<v;
if(bins[j]<10)
cout<<v;
cout<<bins[j];
cout<<l;
for(int i=0; i<bins[j]; i++)
if (bins[i] < 100)
{
cout<<r;
cout<< " ";
}
cout<<endl;
if (bins[i] < 10)
{
cout<< " ";
}
cout<< bins[i]<<"|";
for (size_t j = 0; j < bins[i]; j++)
{
cout<< "*";
}
cout<< "\n";
}
}
int main()
{
Input in = input_data();
auto bins = make_histogram(in.numbers, in.bin_count);
show_histogram_text(bins, in.bin_count);
return 0;
}

Загрузка…
Отмена
Сохранить