HDU 1020 Encoding

A - Encoding

Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

Submit Status Practice HDU 1020

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

2ABCABBCCC 

 

Sample Output

ABCA2B3C 

//输入时同一个字母只能连续输入，例如ASSDD，而不能以ASDSD的形式输入。判断出一个字母的个数就直接输出、

#include<stdio.h>

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