hdoj1020--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<string.h>
using namespace std;
int main()
{
    int T;
    cin>>T;
    getchar();
    while(T--)
    {
		char a[10000],c;
		int i,t=0;
		gets(a);
		c=a[0];
		for(i=0;i<strlen(a);i++)
		{
			if(c==a[i])
				t++;
			else
			{
				if(t==1)
					cout<<a[i-1];
				else
					cout<<t<<a[i-1];
				t=1;
				c=a[i];
			}
		}
		if(t==1) cout<<a[i-1];
		else cout<<t<<a[i-1];
		cout<<endl;
    }
    return 0;
}