Encoding

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
  
  

 

代码：

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int main()
{
   int t;
   scanf("%d",&t);
   getchar();
   char a[10005],b[10005];
   while(t--)
   {
     scanf("%s",a);
     getchar();
     int len=strlen(a);
     int ans=1;
     for(int i=0;i<len;i++)
     {
        if(a[i]==a[i+1])
                ans++;
            else
            {
                if(ans==1)
                    printf("%c",a[i]);
                else
                    printf("%d%c",ans,a[i]);
                ans=1;
            }
     }
     printf("\n");
   }
    return 0;
}