Encoding
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 32652 Accepted Submission(s): 14505
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
Recommend
1 #include<queue> 2 #include<map> 3 #include<math.h> 4 #include<stdio.h> 5 #include<string.h> 6 #include<iostream> 7 #include<algorithm> 8 using namespace std; 9 #define N 100005 10 int n,i,j,ma,cnt; 11 char str[N]; 12 int main() 13 { 14 int t;cin>>t; 15 while(t--) 16 { 17 cnt=0; 18 scanf("%s",str); 19 for(int i=0;str[i];i++) 20 { 21 if(str[i]==str[i+1]) 22 { 23 cnt++; 24 continue; 25 } 26 if(cnt) 27 { 28 printf("%d%c",cnt+1,str[i]); 29 cnt=0; 30 continue; 31 } 32 printf("%c",str[i]); 33 } 34 printf(" "); 35 } 36 return 0; 37 }