| Submit | All submissions | Best solutions | Back to list |
STRINGPR - STRING PROBLEM |
Given a run length coding, convert it into a string, in-place.
Input
The first line consists of an integer t, the number of test cases. Each test case consists of a string representing the run length code.
Constraints
1 <= t <= 100
The run length code can be up to a maximum of 30 characters (all in lower case.)
Each number in the run length code will not exceed 99.
Example
Input: 3 a1b4c2d3 ab2c3d a11b Output: aabbbbbcccdddd abbbccccd aaaaaaaaaaaab
| Added by: | cegprakash |
| Date: | 2012-10-17 |
| Time limit: | 2s |
| Source limit: | 50000B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Languages: | All except: ASM64 |
hide comments
|
2014-01-27 00:07:03 Józek Podlecki
wrong answer ;/ |
|
|
2013-12-25 18:48:19 Samil Vargas
the same code that i use for look and say but inversed. :p |
RSS