Encoding

描述

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.

输入

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.

输出

For each test case, output the encoded string in a line.

样例输入

2
ABC
ABBCCC

样例输出

ABC
A2B3C

#include<stdio.h>
#include<string.h>
int main()
{
    char st[100000];
    int st2[100000];
    int l,i,k,t,f;
    int n;
    scanf("%d",&n);
    while(n--)
    {
            scanf("%s",&st);
            getchar();
            l=strlen(st);
            memset(st2,0,sizeof(st2));
            for(i=0; i<l; i++)
            {
                for(k=i+1; st[i]==st[k]; k++)
                {
                    st2[i]++;
                }
                if(st2[i]+1>1) printf("%d",st2[i]+1);
                printf("%c",st[i]);
                i=k-1;
            }
                printf("\n");
    }
    return 0;
}