Encoding(水题)

Encoding
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 47739 Accepted Submission(s): 21184

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

#include<stdio.h>
#include<string.h>

char ch[10007];
int main()
{
    int ncase;
    scanf("%d",&ncase);
    while(ncase--)
    {
        scanf("%s",ch);
        int cnt = 1;
        char pre = ch[0];
        for(int i = 1;i<=strlen(ch);i++)
        {
            if(pre!=ch[i])
            {
                cnt==1?printf("%c",pre):printf("%d%c",cnt,pre);
                pre = ch[i];
                cnt = 1;
            }
            else
            {
                cnt++;
            }
        }
       printf("\n");
    }
    return 0;
}