原题:
Encoding
1000ms 32768K
描述:
Given a string containing only 'A' - 'Z', we could encode it using the following method:
1. Each sub-string containing k same characters should be encoded to "kX" where "X" is the only character in this sub-string.
2. If the length of the sub-string is 1, '1' should be ignored.
输入:
The first line contains an integer N (1 <= N <= 100) which indicates the number of test cases. The next N lines contain N strings. Each string consists of only 'A' - 'Z' and the length is less than 10000.
输出:
For each test case, output the encoded string in a line.
样例输入:
2 ABC ABBCCC
样例输出:
ABC A2B3C
(链接:Encoding | JXNUOJ)
翻译:
解码
已知一个只含字母A~Z的字符串,我们需要按以下方式解码该字符串:
1.每个包含k个相同字符的子串应该被解码成“kX”,X是这个子串中唯一的字符
2.如果子串的长度为1,“l”应该被忽略
输入:
第一行包括一个整数N(1<=N<=100),代表测试组数。接下来N行包含N个字符串。每个字符串仅由“A”~“Z”并且其长度少于10000.
输出:
对于每个测试数组,在一行中输出解码后的字符串。