|
|
@ -46,13 +46,88 @@ find_minmax(vector<double>& numbers, double& min, double& max){
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
vector<size_t> make_histogram(vector<double>& numbers, size_t bin_count){
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
vector<size_t> bins(bin_count);
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
double min, max;
|
|
|
|
|
|
|
|
find_minmax(numbers, min, max);
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
double bin_size = (max - min) / bin_count;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
for (size_t i = 0; i < numbers.size(); i++) {
|
|
|
|
|
|
|
|
bool found = false; // òåêóùåå ñîñòîÿíèå òåêóùåãî ýëåìåíòà. Ýëåìåíò íå ðàñïðåäåëåí â êîðçèíó
|
|
|
|
|
|
|
|
for (size_t j = 0; (j < bin_count - 1) && !found; j++) { // áåð¸ì j-þ êîðçèíó
|
|
|
|
|
|
|
|
auto lo = min + j * bin_size; // îïðåäåëÿåì ãðàíèöû äàííîé êîðçèíû
|
|
|
|
|
|
|
|
auto hi = min + (j + 1) * bin_size;
|
|
|
|
|
|
|
|
if ((lo <= numbers[i]) && (numbers[i] < hi)) { // ïîäñòàâëÿåì ïîä ýòè ãðàíèöû i-é ýëåìåíò èç numbers
|
|
|
|
|
|
|
|
bins[j]++; // åñëè ýëåìåíò íàõîäèòñÿ â äàííîì äèàïàçîíå (ãðàíèöàõ), òî óâåëè÷èâàåì ñ÷åò÷èê j-îé êîðçèíû
|
|
|
|
|
|
|
|
found = true; // ïåðåêëþ÷àåì "ôëàæîê", ÷òîáû ïðåêðàòèòü ïåðåáîð êîðçèí è ïåðåéòè ê ñäåä. ýë. èç numbers
|
|
|
|
|
|
|
|
} // òî åñòü òåïåðü ýëåìåíò ðàñïðåäåëåí â êîðçèíó è íåò íóæäû ïåðåáèðàòü îñòàëüíûå êîðçèíû
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!found) { // à åñëè æå âñ¸ òàêè ýë. íå ðàñïðåäåëåí, òî ýòî çíà÷èò, ÷òî îí ïîïàäàåò â ïîñëåäíèé äèàïàçîí
|
|
|
|
|
|
|
|
bins[bin_count - 1]++; // äîáàâëÿåì ýòîò ýë. â ïîñëåäíþþ êîðçèíó
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
return bins;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
int
|
|
|
|
int
|
|
|
|
main()
|
|
|
|
main()
|
|
|
|
{
|
|
|
|
{
|
|
|
|
Input in = input_data();
|
|
|
|
auto in = input_data();
|
|
|
|
|
|
|
|
auto bins = make_histogram(in.numbers, in.bin_count);
|
|
|
|
|
|
|
|
|
|
|
|
double min, max;
|
|
|
|
size_t max_count = 0;
|
|
|
|
find_minmax(in.numbers, min, max);
|
|
|
|
for (size_t x: bins) {
|
|
|
|
|
|
|
|
if (x > max_count) {
|
|
|
|
|
|
|
|
max_count = x;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
if (max_count > MAX_ASTERISK) {
|
|
|
|
|
|
|
|
for (size_t count: bins) {
|
|
|
|
|
|
|
|
size_t height = MAX_ASTERISK * (static_cast<double>(count) / max_count);
|
|
|
|
|
|
|
|
if (count < 10) {
|
|
|
|
|
|
|
|
cout << " " << count << "|";
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
else if (count >= 100) {
|
|
|
|
|
|
|
|
cout << count << "|";
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
else {
|
|
|
|
|
|
|
|
cout << " " << count << "|";
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
for (size_t i = 0; i < height; i++) {
|
|
|
|
|
|
|
|
cout << "*";
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
cout << "\n";
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
else {
|
|
|
|
|
|
|
|
for (size_t x: bins) {
|
|
|
|
|
|
|
|
if (x < 10) {
|
|
|
|
|
|
|
|
cout << " " << x << "|";
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
else if (x >= 100) {
|
|
|
|
|
|
|
|
cout << x << "|";
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
else {
|
|
|
|
|
|
|
|
cout << " " << x << "|";
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
for (size_t i = 0; i < x; i++) {
|
|
|
|
|
|
|
|
cout << "*";
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
cout << "\n";
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|