CCC '19 J2 - Time to Decompress

View as PDF

Submit solution

Points: 3
Time limit: 1.0s
Memory limit: 32M

Problem type

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 N and a symbol. You can decode that message by writing out that symbol N times in a row on one line.

Given a message that your friend has encoded, decode it.

Input Specification

The first line of input contains L, the number of lines in the message.

The next L lines each contain one positive integer less than 80, followed by one space, followed by a (non-space) character.

Output Specification

The output should be L lines long. Each line should contain the decoding of the corresponding line of the input. Specifically, if line i + 1 of the input contained N x, then line i of the output should contain just the character x printed N times.

Sample Input

4
9 +
3 -
12 A
2 X

Output for Sample Input

+++++++++
---
AAAAAAAAAAAA
XX

Comments

There are no comments at the moment.