hdoj 1020 encoding

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

 

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>
int main()
{
    int n;
    scanf("%d",&n);
    getchar();
    while(n--)
    {
        char ch[10010];
        int count=1,i,len;
        gets(ch);
        len=strlen(ch);
        for(i=0;i<len;i++)
        {
                if(ch[i]==ch[i+1])
                {
                    count++;
                    }
                    else
                    {
                        if(count==1)
                        printf("%c",ch[i]);
                        else
                        {
                        printf("%d%c",count,ch[i]);
                        count=1;
                            }               
                        }
            }
            printf("\n");
        }
    return 0;
    }