本文共 887 字，大约阅读时间需要 2 分钟。

1、

2、题目：

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.

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 100.

For each test case, output the encoded string in a line.

2

ABC

#include
   
    #include
    
     #include
     
      using namespace std;char str[110];int main(){    int t;    scanf("%d",&t);    while(t--)    {        scanf("%s",str);        int len=strlen(str),j;        for(int i=0;i
     
    
   

转载地址：http://heddi.baihongyu.com/