HDU1020（水题）

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
  
  

 

 

//看错题目，WA了几次，ORZ

 

[cpp] view plain copy

print ?

1. #include <iostream>  
2. #include <cstdio>  
3. #include <cstring>  
4. using namespace std;  
5.   
6. int main()  
7. {  
8.     int n,i,cnt;  
9.     char str[10005];  
10.     cin >> n;  
11.     while(n--)  
12.     {  
13.         cin >> str;  
14.         for(i = 0; str[i]!='\0';)  
15.         {  
16.             cnt = 1;  
17.             while(str[i] == str[i+1])  
18.             {  
19.                 cnt++;  
20.                 i++;  
21.             }  
22.             if(cnt == 1)  
23.             cout << str[i];  
24.             else  
25.             cout << cnt << str[i];  
26.             i++;  
27.         }  
28.         cout << endl;  
29.     }  
30.   
31.     return 0;  
32. }  

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;

int main()
{
    int n,i,cnt;
    char str[10005];
    cin >> n;
    while(n--)
    {
        cin >> str;
        for(i = 0; str[i]!='\0';)
        {
            cnt = 1;
            while(str[i] == str[i+1])
            {
                cnt++;
                i++;
            }
            if(cnt == 1)
            cout << str[i];
            else
            cout << cnt << str[i];
            i++;
        }
        cout << endl;
    }

    return 0;
}