Сommit
132338cf67
@ -0,0 +1,83 @@
|
||||
#include <iostream>
|
||||
#include <vector>
|
||||
|
||||
using namespace std;
|
||||
|
||||
int main()
|
||||
{
|
||||
size_t number_count;
|
||||
cerr << "number count="; cin>>number_count; // ââîä êîëè÷åñòâà ÷èñåë
|
||||
|
||||
char l,r,v;
|
||||
|
||||
vector<double> numbers(number_count);
|
||||
|
||||
for (int i=0; i<number_count; i++)
|
||||
{
|
||||
cin>>numbers[i]; // ââîä ìàññèâà ÷èñåë
|
||||
}
|
||||
size_t bin_count;
|
||||
cerr<<"bin count="; cin>>bin_count; // ââîä êîëè÷åñòâà êîðçèí
|
||||
|
||||
vector<size_t> bins(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;
|
||||
}
|
||||
}
|
||||
|
||||
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]++;
|
||||
}
|
||||
}
|
||||
|
||||
cout<<"risunok-";cin>>r;
|
||||
cout<<"linia osi-";cin>>l;
|
||||
cout<<"viravnivanie-";cin>>v;
|
||||
|
||||
|
||||
|
||||
|
||||
for (int j=0; j<bin_count; j++)
|
||||
{
|
||||
|
||||
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++)
|
||||
{
|
||||
cout<<r;
|
||||
}
|
||||
cout<<endl;
|
||||
|
||||
|
||||
}
|
||||
|
||||
|
||||
return 0;
|
||||
}
|
Загрузка…
Ссылка в новой задаче