HDU 1020 Encoding

Encoding

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

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
  
  

题意不要搞错了！

AC代码：

#include<cstdio>
#include<cstring>
using namespace std;
const int maxn=10000+10;
char s[maxn];
int main(){
	int T;
	scanf("%d",&T);
	while(T--){
		scanf("%s",s);
		int count1=1;
		int len=strlen(s);
			for(int i=1;i<=len;i++){
				if(s[i-1]==s[i])count1++;
			    else {
			    	if(count1==1)printf("%c",s[i-1]);
			    	else {
			    		printf("%d%c",count1,s[i-1]);
			    		count1=1;
					}
				}
			}
			
			printf("\n");
	}
	return 0;
}