Сommit
b76cd0884e
@ -0,0 +1,60 @@
|
||||
#include <iostream>
|
||||
#include <vector>
|
||||
using namespace std;
|
||||
int main()
|
||||
{
|
||||
size_t number_count;
|
||||
cout << "Enter number count: ";
|
||||
cin >> number_count;
|
||||
vector<double> numbers(number_count);
|
||||
for(int i=0; i<number_count; i++){
|
||||
cout << "numbers["<<i<<"]=";
|
||||
cin >> numbers[i];
|
||||
}
|
||||
size_t bin_count;
|
||||
cout<< "Enter bin count: ";
|
||||
cin>> 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);
|
||||
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]++;}
|
||||
}
|
||||
float procent;
|
||||
for(size_t i=0; i<bin_count; i++)
|
||||
{
|
||||
|
||||
int procent =(bins[i] / number_count)*100;
|
||||
|
||||
cout<<endl;
|
||||
|
||||
cout<<procent<<"%| ";
|
||||
for(size_t j=0; j<=bins[i]-1; j++)
|
||||
{
|
||||
|
||||
cout<<"*";
|
||||
}
|
||||
cout<<endl;
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
Загрузка…
Ссылка в новой задаче