HDU 1020 Encoding

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<cstring>
#include<cstdio>
using namespace std;
int main()
{
  char a[10001],b[10001];
  int t,l,i;
  cin>>t;
  while(t--)
  {
    scanf("%s",a);
    for(i=0;a[i]!='\0';i++)
    {
       l=1;
      while(a[i]==a[i+1])
      {
        l++;
        i++;
      }
      if(l!=1)
      cout<<l<<a[i];
      else
        cout<<a[i];
    }
    cout<<endl;
  }


}