（TOJ1248）Encoding

描述

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.

输入

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.

输出

For each test case, output the encoded string in a line.

样例输入

2
ABC
ABBCCC

样例输出

ABC
A2B3C

#include <stdio.h>
#include <math.h>
#include <ctype.h>
#include <string.h>

char a[10001];

void deal(char *s){
    int i,j,k;
    int L,count=0;
    i=0;
    L=strlen(s);
    while(i<L){
        j=i+1;
        if(s[i]!=s[j]){
            printf("%c",s[i]);
            
        }else{
            k=j+1;
            count+=2;
            while(s[k]==s[j]){
             k++;count++;
            }
            printf("%d%c",count,s[j]);
            count=0;
            i=k-1;
        }
        i++;
    }
    printf("\n");
}

void solve(){
  int n;
    scanf("%d",&n);
    getchar();
    while(n--){
        gets(a);
        deal(a);
    }    
}


int main(){
    solve();
    return 0;
}