hdu1020 Encoding（A2B3C）

Encoding

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

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,i,j,k;
    char s1[10010],s2[1000];
    scanf("%d",&n);
    for(i=1; i<=n; ++i)
    {
        memset(s2,0,sizeof(s2));
        scanf("%s",s1);
        for(j=0; j<=strlen(s1); ++j)
        {
            for(k=j+1; k<=strlen(s1); ++k)
            {
                if(s1[j]!=s1[k])
                {
                    if(k-j==1)
                    {
                        sprintf(s2,"%s%c",s2,s1[j]);
                    }
                    else
                    {
                        sprintf(s2,"%s%d%c",s2,k-j,s1[j]);
                    }
                    j=k;
                }
            }
        }
        printf("%s\n",s2);
    }
    return 0;
}