Note that the size of both the risers and treads must be integers, and that they are at most 1,000. This means
that a brute force search is certainly possible. We'll loop through all possible heights and count the number
of configurations that are possible.

For each riser height, we first check to see if it evenly divides the total height. If not, then we can
continue on with the next height. If so, then we'll look at the treads.

The number of treads will be one less than the number of risers. We can compute the number of risers with
(totalHeight / riserHeight). Then just subtract one from that result to get the number of treads.

Next, we look for ways to discount the current number of risers and treads. The problem statement says that
their must be at least one tread (and riser), so we can throw out any cases where the number of treads is
0. Again, just like with the risers, the total width must be evenly divided by the number of treads, so we can
skip any case where that isn't true. And finally, any case where the width of each tread
(totalWidth / numTreads) is smaller than the minimum allowed can also be skipped.

Passing each of those tests, leaves us with a valid configuration, so increment the counter. After looping
throug all possibilities, return the value in the counter.

Thank you for taking the time to read this solution. I welcome
any feedback you may have.