HDU1020Encoding

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<stdio.h>
#include<string.h>
char str[10005];
int num[30];
int main() {
    int n;
    scanf("%d",&n);
    while(n--) {
        scanf("%s",str);
        int len=strlen(str);
        int sum=1;
        for(int i=0;i<len;++i)
        if(str[i]==str[i+1])
        sum++;
        else {
            if(sum==1)
            printf("%c",str[i]);
            else
            printf("%d%c",sum,str[i]);
            sum=1;
        }
        str[0]='\0';
        printf("\n");
    }
    return 0;
}