Сommit
6a0775364f
@ -0,0 +1,75 @@
|
||||
#include <iostream>
|
||||
#include <vector>
|
||||
|
||||
using namespace std;
|
||||
|
||||
int main()
|
||||
{
|
||||
setlocale(LC_ALL, "Russian");
|
||||
|
||||
size_t number_count, bin_count;
|
||||
size_t max_count = 0;
|
||||
|
||||
cerr << "Ââåäèòå êîëè÷åñòâî îöåíîê: ";
|
||||
cin >> number_count;
|
||||
|
||||
vector<double> numbers(number_count);
|
||||
|
||||
for(size_t i = 0; i < number_count; i++){
|
||||
cerr << "Ââåäèòå ÷èñëî " << i + 1 << " : ";
|
||||
cin >> numbers[i];
|
||||
}
|
||||
|
||||
cerr << "Ââåäèòå êîëè÷åñòâî êîðçèí: ";
|
||||
cin >> bin_count;
|
||||
|
||||
vector<size_t> bins(bin_count, 0);
|
||||
|
||||
double min = numbers[0];
|
||||
double max = numbers[0];
|
||||
for (size_t i = 1; i < number_count; i++) {
|
||||
if (numbers[i] < min) {
|
||||
min = numbers[i];
|
||||
}
|
||||
if (numbers[i] > max) {
|
||||
max = numbers[i];
|
||||
}
|
||||
}
|
||||
|
||||
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]++;
|
||||
}
|
||||
}
|
||||
|
||||
//ìàêñèìóì ýëåìåíòîâ â êîðçèíå
|
||||
for (size_t i = 0; i < bin_count; i++) {
|
||||
if (bins[i] > max_count) {
|
||||
max_count = bins[i];
|
||||
}
|
||||
}
|
||||
|
||||
for (size_t i = 1; i <= max_count; i++) { //ïî òñðîêàì
|
||||
for (size_t j = 0; j < bin_count; j++) { //ïî êîðçèíàì
|
||||
if (bins[j] >= i) {
|
||||
cout << "*";
|
||||
} else {
|
||||
cout << " ";
|
||||
}
|
||||
}
|
||||
cout << endl;
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
Загрузка…
Ссылка в новой задаче