## CCC '19 J2 - Time to Decompress

View as PDF

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 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.

#### Input Specification

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.

#### Output Specification

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.

#### Sample Input

4
9 +
3 -
12 A
2 X

#### Output for Sample Input

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