Encoding

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.

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 <stdlib.h>
#include <string.h>
char s[10001];
int main()
{

    int n,i,l,z,f;
    scanf("%d",&n);
    while(n--)
    {
        scanf("%s",s);
        l=strlen(s);
        z=0;
        while(i<l)
        {
            f=1;
            for(i=z; i<l; i++)
            {

                if(s[i]==s[i+1])
                    f++;
                else
                {
                    if(f!=1)
                        printf("%d%c",f,s[i]);
                    else
                        printf("%c",s[i]);
                    break;
                }
            }
            z=i+1;
        }
        printf("\n");
    }
    return 0;
}