小试身手

小试身手

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
AABBCC
ABCC

Sample Output

2A2B2C
AB2C

#include<stdio.h>
#include<string.h>
int main(){
	int i,j,k,n,t,p,fagh;
	char a[1000];
	int c[1000];
	scanf("%d",&n);
	char *b[n],*v[n];
	for(i=0;i<n;i++){
		int h=0;
		gets(a);
		for(j=0;a[j]!='\0';j++){
			fagh=0;
			for(k=0;k<j;k++){
   				if(a[j]==a[k]) fagh=1;
			}
			if(fagh==0){
				b[i][h++]=a[j];
			}
		}
		
		for(t=0;t<h;t++){
			int count=0;
			for(p=0;a[p]!='\0';p++){
				if(a[p]==b[i][t]) count++;
			}
			c[t]=count;
		}	
		for(t=0;t<h;t++){
			if(c[t]>1) printf("%d",c[t]);
			printf("%c",b[i][t]);
		} 	
	}
	return 0;
}