hdu_1020_Encoding_201310172120

Encoding

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 22110    Accepted Submission(s): 9687

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 str[];

 int main()
 {
     int cases;
     scanf("%d",&cases);
     getchar();
     while(cases--)
     {
         int i,len,count=;
         char c;
         scanf("%s",str);
         len=strlen(str);
         i=;c=str[i];
         while(i<len)
         {
             while(str[i+] == c)
             {
                 count++;
                 i++;
             }
             if(count)
             {
                 printf("%d%c",count+,c);
                 count = ;
                 c = str[i+];
             }
             else
             {
                 printf("%c",c);
                 count = ;
                 c = str[i+];
             }
             i++;
         }
         printf("\n");
     }
     return ;
 }

做过，水过！