Encoding
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 78876 Accepted Submission(s): 34964
Problem Description
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.
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.
Input
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.
Output
For each test case, output the encoded string in a line.
Sample Input
2 ABC ABBCCC
Sample Output
ABC A2B3C
Author
ZHANG Zheng
#include <iostream>
#include <string>int main() {int n;std::cin >> n;while(n--){std::string s;std::cin>>s;int count=1;for(int i = 0;i<s.length();i++){if(i+1<s.length()&&s[i]==s[i+1]){count++;}else{if(count>1){std::cout<<count<<s[i];}else{std::cout<<s[i];}count = 1;}}std::cout<<std::endl;}return 0;
}
