杭电OJ

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
#include
int main()
{
    int t;
    char a[10010];
    scanf("%d",&t);
    getchar();
    while(t--)
    {

        gets(a);
        char ch=a[0];
        int l=strlen(a);
        int c=1,i;
        for(i=1;iif(ch==a[i])
            {
               c++;
            }

            else
            {
                if(c==1)
                {
                    printf("%c",ch);
                }
                else
                {
                    printf("%d%c",c,ch);
                }
                ch=a[i];
                c=1;
            }
        }
        if(c==1)
        {
            printf("%c",ch);
        }
        else
        {
            printf("%d%c",c,ch);
        }
        printf("\n");
    }
    return 0;
}