Problem D
Histogram
and its preliminaries, 1997–2020.
If only we could automate this…
The term “histogram” was first introduced in 1895 by Karl Pearson. This is also the year that the portable electric drill was invented. It may not be a coincidence that we speak about “data drilling” today. Most things back then were not electric however, and histograms were still hand crafted. Nowadays, we like things electric and automated. The Bureaucratic Affiliation for Printing Charts needs to create a lot of histograms for a lot of data points, so they come to you for help to automate the printing of histograms.
Given a list of data points, print a histogram.
Input
The input consists of:
-
One line containing three integers $n$, $s$, and $k$ ($1 \leq n, s, k \leq 1000$), the number of bins, the size per bin, and the number of data points, respectively.
-
One line containing $k$ integer data points $x$ ($1 \leq x \leq n \cdot s$).
Output
Output the histogram. That is, write a rectangle of characters. The rectangle should be as wide as the number of bins, $n$. Each column of the rectangle should have
-
a hyphen (“-”) at the bottom;
-
on top of that, as many hash signs (“#”) as there are items in the bin;
-
on top of that, as many periods (“.”) as are needed to fill out the rectangle.
The rectangle should be just high enough to display a “#” for each element in every bin, but no higher.
| Sample Input 1 | Sample Output 1 |
|---|---|
3 1 6 1 2 3 2 1 2 |
.#. ##. ### --- |
| Sample Input 2 | Sample Output 2 |
|---|---|
3 10 5 1 9 11 29 24 |
#.# ### --- |
| Sample Input 3 | Sample Output 3 |
|---|---|
6 10 5 19 20 21 42 42 |
.#..#. .##.#. ------ |
