HDU 1020 Encoding (字符串处理)

Encoding

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

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

Thefirst line contains an integer N (1 <= N <= 100) which indicatesthe number of test cases. The next N lines contain N strings. Eachstring 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

解题：

       一道很无语的题目，对于字母的输出不用排序输出，而且计算相同的字符只需要计算相邻的就可以。
输入：ABBCCCA
输出：A2B3CA

输入：AACCBB
输出：2A2C2B

#include <iostream>using namespace std ;int main(){ int t,i,num ; char a[10002]; scanf("%d%*c",&t); while(t--) { gets(a); num=1 ; for(i=0;a[i]!='/0';i++) { if(a[i]==a[i+1]) num++; if(a[i]!=a[i+1]||a[i+1]=='/0') { if(num==1) printf("%c",a[i]); else printf("%d%c",num,a[i]); num=1 ; } } printf("/n"); } return 0 ;}