HDU 1020 Encoding

Encoding Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 28   Accepted Submission(s) : 7 Font: Times New Roman | Verdana | Georgia Font Size: ← → 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 Author ZHANG Zheng #include<stdio.h> #include<string.h> int main() {     char str[10004];     int n,i,count,j;     while(scanf("%d",&n)!=EOF)     {             while(n--)         {           scanf("%s",str);          for(i=0,count=0;str[i]+1!='\0';i++)         {                                 if(str[i]==str[i+1])                       count++;                   else                   {                       if(count>1)                       printf("%d%c",count+1,str[i]);                   else                        printf("%c",str[i]);                      count=0;                   }          }          printf("\n");         }     }     return 0; }