hdu 1020 Encoding

Encoding

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 45728    Accepted Submission(s): 20224

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>
using namespace std;
int main()
{
    int n,i;
    int cnt;
    char str[10002];
    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;
}