HDU 1020.Encoding-字符压缩

Encoding

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

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

 

Author

ZHANG Zheng

 

 

代码:

#include<stdio.h>
#include<string.h>
int main(){
    char str[10005];
    int n,i,cnt;
    while(~scanf("%d",&n)){
        while(n--){
            scanf("%s",&str);
            for(i=0;str[i]!='';i++){
                cnt=1;
                while(str[i]==str[i+1]){
                      cnt++;i++;
                }
                if(cnt==1) printf("%c",str[i]);
                else printf("%d%c",cnt,str[i]);
            }
            printf("
");
        }
    }
    return 0;
}