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.
2166: Encoding
时间限制: 1 Sec 内存限制: 128 MB提交: 50 解决: 15
[提交][状态][讨论版][命题人:]
题目描述
输入描述
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来源
-
Anything about this OnlineJudge, Please Contact Administrator. Click add QQ
OJ system based on HUSTOJ Project , UI based on Twitter Bootstrap
Copyright 2016 ACM算法攻关部
关于网站改版