HDU 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

题目大意：

将输入的大写字母字符串转换格式输出，在大写字母前输出该字母的个数，如果个数为1，则可忽略。

代码如下：

#include<iostream>
#include<string>
using namespace std;

char s[10005];
int main()
{
	int t;
	cin>>t;
	while(t--)
	{
		cin>>s;
		int len=strlen(s);
		int cnt=1;
		for(int i=0;i<len;i++)
		{
			if(s[i]==s[i+1])
				cnt++;
			else
			{
				if(cnt==1)
					cout<<s[i];
				else
					cout<<cnt<<s[i];
				cnt=1;
			}
		}
		cout<<endl;
	}
	return 0;
}