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

题目大意：对于给出的大写字符串，将其相邻并且相同的字符合并并统计其个数，用数字加字符的形式表示，个数为1则只用字符表示。如BBBB表示成4B，K表示为K。

#include <cstdio>
#include <string.h>
int main(){
    int t;
    char str[10001];
    scanf("%d",&t);
    while(t--){
        scanf("%s",str);
        int count=1;
        for(int i=0;i<strlen(str);i++){
            if(str[i]==str[i+1])count++;
            else{
                if(count==1) printf("%c",str[i]);
                else printf("%d%c",count,str[i]);
                count=1;
            }
        }
        printf("\n");
    }
}