Encoding

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.

 

 

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

JGShining

 

答案：

int main()
{
 int n, i, k;
 char input[10000], ch;

 scanf("%d", &n);
 while (n--)
 {
  scanf("%s", input);

  for (i = 0; i < strlen(input); ++i)
  {
   k = 0;
   ch = input[i];
   while (++i < strlen(input) && input[i] == ch) ++k;
   --i;
   if (k == 0)
    printf("%c", ch);
   else
    printf("%d%c", k+1, ch);
  }
  printf("/n");
 }
 
 return 0;
}