Родитель
3937bbe10e
Сommit
808154186a
@ -0,0 +1,82 @@
|
||||
#include <iostream>
|
||||
#include <vector>
|
||||
|
||||
using namespace std;
|
||||
|
||||
int main() {
|
||||
//êîíñòàíòû äëÿ ìàñøòàáèðîâàíèÿ
|
||||
const size_t SCREEN_WIDTH = 80;
|
||||
const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1;
|
||||
//ââîä êîëè÷åñòâà ÷èñåë
|
||||
size_t number_count;
|
||||
cerr << "Enter number count: ";
|
||||
cin >> number_count;
|
||||
//ââîä ÷èñåë
|
||||
vector<double> numbers(number_count);
|
||||
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);
|
||||
double min = numbers[0];
|
||||
double max = numbers[0];
|
||||
for (double x : numbers) {
|
||||
if (x < min) {
|
||||
min = x;
|
||||
}
|
||||
else if (x > max) {
|
||||
max = x;
|
||||
}
|
||||
}
|
||||
//ðàçíèöà ìåæäó ãðàíèöàìè
|
||||
double bin_size = (max - min) / bin_count;
|
||||
//ðàñïðåäåëåíèå ÷èñåë ïî êîðçèíàì è ïîèñê ìàêñèìàëüíîãî êîëè÷åñòâà ÷èñåë â êîðçèíå
|
||||
size_t max_count = 0;
|
||||
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]++;
|
||||
if (bins[j] > max_count) {
|
||||
max_count = bins[j];
|
||||
}
|
||||
found = true;
|
||||
}
|
||||
}
|
||||
if (!found) {
|
||||
bins[bin_count-1]++;
|
||||
if (bins[bin_count - 1] > max_count) {
|
||||
max_count = bins[bin_count - 1];
|
||||
}
|
||||
}
|
||||
}
|
||||
//âûâîä
|
||||
for (size_t i = 0;i < bin_count;i++){
|
||||
if (bins[i] < 100){
|
||||
cout << " ";
|
||||
}
|
||||
if (bins[i] < 10){
|
||||
cout << " ";
|
||||
}
|
||||
cout << bins[i] << "|";
|
||||
if (max_count > MAX_ASTERISK){
|
||||
size_t height = MAX_ASTERISK * (static_cast<double>(bins[i]) / max_count);
|
||||
for (size_t j = 0;j < height;j++){
|
||||
cout << "*";
|
||||
}
|
||||
}
|
||||
else{
|
||||
for (size_t j = 0;j < bins[i];j++){
|
||||
cout << "*";
|
||||
}
|
||||
}
|
||||
cout << endl;
|
||||
}
|
||||
return 0;
|
||||
}
|
Загрузка…
Ссылка в новой задаче