Time limit: 1.0s
Memory limit: 256M
Canadian Computing Competition: 2019 Stage 1, Junior #2
You and your friend have come up with a way to send messages back and forth.
Your friend can encode a message to you by writing down a positive integer and a symbol. You can decode that message by writing out that symbol times in a row on one line.
Given a message that your friend has encoded, decode it.
The first line of input contains , the number of lines in the message.
The next lines each contain one positive integer less than , followed by one space, followed by a (non-space) character.
The output should be lines long. Each line should contain the decoding of the corresponding line of the input. Specifically, if line of the input contained
x, then line of the output should contain just the character
x printed times.
4 9 + 3 - 12 A 2 X
Output for Sample Input
+++++++++ --- AAAAAAAAAAAA XX
Time to find where the decompressed mess is, among the rest!
Where can you find the solutions to these problems?
For past CCC contests, there is a website that hosts unofficial solutions and test data. Although the solutions are readily available, it's advised you look at the solutions only when necessary because you don't want to become dependent on others to solve the problems for you.
Where are these solutions you speak of? I can only find test data at the cemc site.
Oh, you're right: I thought there were solutions, but apparently they don't have any, so I guess just use the unofficial ones.
It's pretty annoying that Waterloo provides solutions for every contest EXCEPT the CCC and CCO.