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.
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.
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.
4 9 + 3 - 12 A 2 X
+++++++++ --- AAAAAAAAAAAA XX
不公開 測資點#0 (20%): 1.0s , <1K
不公開 測資點#1 (20%): 1.0s , <1K
不公開 測資點#2 (20%): 1.0s , <1K
不公開 測資點#3 (20%): 1.0s , <1K
不公開 測資點#4 (20%): 1.0s , <1K
| ID | User | Problem | Subject | Hit | Post Date |
沒有發現任何「解題報告」 |
|||||