ACM题目 - 杭电1020 编码

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<iostream>
#include<string>
using namespace std;
main(){
    int n;
    cin>>n;
    while(n--){
        string a;
        cin>>a;
        int sum=1;
        int t=0,flag=0,x=1;
        for(int i=0;i<a.length()-1;i++){
            if(a[i]==a[i+1]){
                a[i]='1';
            }
         }
        for(int i=0;i<a.length();i++){
            if(a[i]!='1' ){
                if(sum!=1){
                cout<<sum;
                }
                cout<<a[i];
                sum=1;
            }
            else {
                sum++;
             }
         }
         cout<<endl;
    }
}