|
|
@ -2,21 +2,25 @@
|
|
|
|
#include <vector>
|
|
|
|
#include <vector>
|
|
|
|
using namespace std;
|
|
|
|
using namespace std;
|
|
|
|
|
|
|
|
|
|
|
|
int main()
|
|
|
|
struct Input {
|
|
|
|
{
|
|
|
|
vector<double> numbers;
|
|
|
|
size_t number_count,bin_count;
|
|
|
|
size_t bin_count{};
|
|
|
|
double min,max;
|
|
|
|
};
|
|
|
|
cout<<"Enter number count: ";
|
|
|
|
Input
|
|
|
|
cin>>number_count;
|
|
|
|
input_data(){
|
|
|
|
vector<double> numbers(number_count);
|
|
|
|
Input in;
|
|
|
|
for (size_t i=0;i<number_count;i++)
|
|
|
|
size_t number_count;
|
|
|
|
{
|
|
|
|
cin >> number_count;
|
|
|
|
cin>>numbers[i];
|
|
|
|
in.numbers.resize(number_count);
|
|
|
|
|
|
|
|
for (size_t i = 0; i < number_count; i++) {
|
|
|
|
|
|
|
|
cin >> in.numbers[i];
|
|
|
|
}
|
|
|
|
}
|
|
|
|
cout<<"Enter bin count: ";
|
|
|
|
cin >> in.bin_count;
|
|
|
|
cin>>bin_count;
|
|
|
|
return in;
|
|
|
|
max=numbers[0];
|
|
|
|
}
|
|
|
|
min=numbers[0];
|
|
|
|
void find_minmax(vector<double> numbers, double min, double max) {
|
|
|
|
|
|
|
|
min = numbers[0];
|
|
|
|
|
|
|
|
max = numbers[0];
|
|
|
|
for (double x : numbers) {
|
|
|
|
for (double x : numbers) {
|
|
|
|
if (x < min) {
|
|
|
|
if (x < min) {
|
|
|
|
min = x;
|
|
|
|
min = x;
|
|
|
@ -25,6 +29,11 @@ int main()
|
|
|
|
max = x;
|
|
|
|
max = x;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
int main()
|
|
|
|
|
|
|
|
{ Input in = input_data();
|
|
|
|
double bin_size = (max - min) / bin_count;
|
|
|
|
double bin_size = (max - min) / bin_count;
|
|
|
|
vector<size_t> bins(bin_count);
|
|
|
|
vector<size_t> bins(bin_count);
|
|
|
|
for (size_t i = 0; i < number_count; i++) {
|
|
|
|
for (size_t i = 0; i < number_count; i++) {
|
|
|
|