This is kind of a contrived problem, but it's the kind that breeds lots of interesting implementations and tests your understanding of lower-level details. So let's do it!
You're given an integer
n and an integer
k. There is an integer
k instances of the digits of
n concatenated together. For example: