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>int main()
{
char s[100010];
int n,i;
scanf("%d",&n);
while(n--)
{
scanf("%s",s);
int num=1;
for(i=0; i<strlen(s); i++)
{
if(s[i]==s[i+1])
num++;
else
{
if(num>1)
printf("%d",num);
printf("%c",s[i]);
num=1;
}
}
printf("\n");
}
}