Encoding
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 20096 Accepted Submission(s): 8680
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
#include<stdio.h>
#include<string.h>
char str[10005];
int main()
{
int t,i,j,len,cnt;
scanf("%d",&t);
getchar();
while(t--)
{
scanf("%s",str);
len=strlen(str);
cnt=1;
for(i=0;i<len;i++)
{
if(str[i]!=str[i+1])
{
if(cnt==1)
printf("%c",str[i]);
else
printf("%d%c",cnt,str[i]);
cnt=1;
}
else
cnt++;
}
printf("\n");
}
return 0;
}