学步园

Encoding

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

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

/* 这题刚开始理解错了，全部统计的，wa了，
 * 再看题是字串，所以应该是连续的,边处理边输出 
 */ 
#include <stdio.h>
#include <string.h>
#include <stdlib.h>

char str[11000];
int num[11000];


void solve( )
{
  int i, j, len, t;
  
  len = strlen(str);
  
  for( i = 0; i < len; i++) {
       if (str[i] == str[i + 1])
           num[str[i] - 'A']++;
       else if ( num[str[i] - 'A'] == 1)
           printf("%c",str[i]);
       else if ( num[str[i] - 'A'] > 1) {
        printf("%d",num[str[i] - 'A']);
          printf("%c",str[i]);
          num[str[i] - 'A'] = 1;
     }
  }
  puts("");
}
          
       
    

int main( )
{
    int N, i;
    scanf("%d", &N);
    while (N--) {
        for( i = 0; i  < 10100; i++)
            num[i] = 1;
        scanf("%s", str);
        solve( );
    }
    return 0;
}