杭电1020（Encoding）

Encoding

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/O1thers)
Total Submission(s): 39720    Accepted Submission(s): 17575

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>
#include<algorithm>
using namespace std;
int nyc[10005]={0};
int main()
{
	int n,m,i;
	string s;
    while(cin>>n){
		while(n--){
			m=1;
			getchar();
			getline(cin,s);
			for(i=0;i<s.length();i++){
					if(s[i+1]==s[i]){
					  m+=1;
					}
					else{
						if(m==1)cout<<s[i];
						else{
							cout<<m<<s[i];
							m=1;
						}
					}
				}
			cout<<endl;
		}

	}
	return 0;
}