|
|
|
@ -3,77 +3,52 @@
|
|
|
|
|
|
|
|
|
|
using namespace std;
|
|
|
|
|
|
|
|
|
|
int main()
|
|
|
|
|
{
|
|
|
|
|
//Ââîä äàííûõ
|
|
|
|
|
size_t number_count;
|
|
|
|
|
cerr<<"Enter number count:";
|
|
|
|
|
cin>>number_count;
|
|
|
|
|
|
|
|
|
|
vector<double> numbers (number_count);
|
|
|
|
|
cerr<<"Enter numbers";
|
|
|
|
|
for (size_t i=0; i<number_count; i++)
|
|
|
|
|
cin>>numbers[i];
|
|
|
|
|
size_t bin_count;
|
|
|
|
|
cerr<<"Enter bin count:";
|
|
|
|
|
cin>>bin_count;
|
|
|
|
|
|
|
|
|
|
//Ðàñ÷¸ò ãèñòàãðàììû
|
|
|
|
|
vector <size_t> bins (bin_count, 0);
|
|
|
|
|
double min=numbers[0];
|
|
|
|
|
double max=numbers[0];
|
|
|
|
|
|
|
|
|
|
for (double number: numbers)
|
|
|
|
|
{
|
|
|
|
|
if (min > number)
|
|
|
|
|
min=number;
|
|
|
|
|
else if (max < number)
|
|
|
|
|
max=number;
|
|
|
|
|
}
|
|
|
|
|
struct Input {
|
|
|
|
|
vector<double> numbers;
|
|
|
|
|
size_t bin_count{};
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
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 ((numbers[i]>=lo) && (numbers[i]<hi))
|
|
|
|
|
{
|
|
|
|
|
bins[j]++;
|
|
|
|
|
found = true;
|
|
|
|
|
Input input_data() {
|
|
|
|
|
size_t number_count, bin_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;
|
|
|
|
|
}
|
|
|
|
|
if (!found)
|
|
|
|
|
|
|
|
|
|
int main()
|
|
|
|
|
{
|
|
|
|
|
bins[bin_count - 1]++;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
Input in = input_data();
|
|
|
|
|
double min, max;
|
|
|
|
|
find_minmax(in.numbers, min, max);
|
|
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
//Âûâîä äàííûõ
|
|
|
|
|
const size_t SCREEN_WIDTH = 80;
|
|
|
|
|
const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1;
|
|
|
|
|
|
|
|
|
|
size_t max_bin=bins[0];
|
|
|
|
|
for (size_t bin:bins)
|
|
|
|
|
if (bin>max_bin)
|
|
|
|
|
max_bin=bin;
|
|
|
|
|
for (size_t bin:bins){
|
|
|
|
|
int height = bin;
|
|
|
|
|
if (max_bin > MAX_ASTERISK){
|
|
|
|
|
height = MAX_ASTERISK * (static_cast<double>(bin) / max_bin);
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void find_minmax(vector<double>& numbers, double& min, double& max) {
|
|
|
|
|
auto counts=numbers.size();
|
|
|
|
|
int i;
|
|
|
|
|
min = number[0];
|
|
|
|
|
max = number[0];
|
|
|
|
|
for (i=0; i<counts;i++) {
|
|
|
|
|
if (number[i]< minn) {
|
|
|
|
|
min = number[i];
|
|
|
|
|
}
|
|
|
|
|
else if (number[i]> maxx) {
|
|
|
|
|
max = number[i];
|
|
|
|
|
}
|
|
|
|
|
if (bin< 100)
|
|
|
|
|
cout<<" ";
|
|
|
|
|
if (bin<10)
|
|
|
|
|
cout<<" ";
|
|
|
|
|
cout<<bin<<"|";
|
|
|
|
|
for (size_t i=0; i<height; i++)
|
|
|
|
|
cout<<"*";
|
|
|
|
|
cout<<endl;
|
|
|
|
|
}
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
êîä
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|