Encoding

Encoding

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

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 t;
	cin>>t;
	while(t--){
		char s[10003];
		cin>>s;
		int len=strlen(s),sum=1;
		char ch=s[0];
		for(int i=1;i<len;i++){
			while(s[i]==ch&&s[i]!='\0'){
				sum++;
				i++;
			}
			if(sum==1)
				cout<<ch;
			else
				cout<<sum<<ch;
			sum=1;
			ch=s[i];
			if(s[i]=='\0')
				break;
		}
		if(ch!='\0')
			cout<<ch;
		cout<<endl;
	}
	return 0;
}