hdu1020

Encoding

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

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 s[10001];

int main(){
    int n, i;
    scanf("%d", &n);
    while(n--){
        scanf("%s", &s);
        int len = strlen(s);
        char tmp = s[0];
        int k=1;
        for(i=1; i<len+1; i++){
            if(tmp == s[i]){
                k++;  
            }else{
                if(k!=1)
                    printf("%d", k);
                printf("%c", tmp);
                tmp = s[i];
                k=1;
            }
        }
        printf("\n");
    }
}