|
|
|
@ -9,6 +9,21 @@ struct Input {
|
|
|
|
|
size_t number_count;
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
void
|
|
|
|
|
find_minmax(vector<double> numbers, double& min, double& max, size_t number_count) {
|
|
|
|
|
min = numbers[0];
|
|
|
|
|
max = numbers[0];
|
|
|
|
|
for (size_t i = 1; i < number_count; i++ ){
|
|
|
|
|
if(numbers[i] < min){
|
|
|
|
|
min = numbers[i];
|
|
|
|
|
}
|
|
|
|
|
else if (numbers[i] > max){
|
|
|
|
|
max = numbers[i];
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Input input_data() {
|
|
|
|
|
Input in;
|
|
|
|
|
cin >> in.number_count;
|
|
|
|
@ -27,19 +42,9 @@ int main(){
|
|
|
|
|
const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1;
|
|
|
|
|
|
|
|
|
|
Input in = input_data();
|
|
|
|
|
size_t number_count;
|
|
|
|
|
cin >> number_count;
|
|
|
|
|
|
|
|
|
|
double minc, maxc;
|
|
|
|
|
minc = maxc = in.numbers[0];
|
|
|
|
|
for (size_t i = 1; i < number_count; i++ ){
|
|
|
|
|
if(in.numbers[i] < minc){
|
|
|
|
|
minc = in.numbers[i];
|
|
|
|
|
}
|
|
|
|
|
else if (in.numbers[i] > maxc){
|
|
|
|
|
maxc = in.numbers[i];
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
find_minmax(in.numbers, minc, maxc, in.number_count);
|
|
|
|
|
|
|
|
|
|
vector<size_t> bins(in.bin_count);
|
|
|
|
|
double bin_size = (maxc - minc) / in.bin_count;
|
|
|
|
|