ZOJ 2478 Encoding

Encoding

---

Time Limit: 2 Seconds      Memory Limit: 65536 KB

---

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

Output

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

Sample Input

2
ABC
ABBCCC

Sample Output

ABC
A2B3C

 #include <iostream>
 #include <string>
 using namespace std;
 int main(){
     int n;
     string s;
     cin >> n;
     while(n--){
         cin >> s;
         int len = s.length();
         int num = ;
         if(len == ){
                cout << s << endl;
                continue;
         }
         for(int i = ; i < len - ; i++){
             if(s[i] == s[i + ]){
                 num++;
             } else {
                 if(num == )
                     cout << s[i];
                 else
                     cout << num << s[i] ;
                 num = ;
             }
         }
         if(s[len - ] == s[len - ])
             cout << num << s[len - ];
         else
             cout << s[len - ];
         cout << endl;
     }
    // system("pause");
     return ;
 }