杭电acm1020

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>
int main(){
	int count,i,n;
	char a[100001];
	scanf("%d",&n);
	while(n--){
		scanf("%s",a);
		count=1;
		for(i=0;i<strlen(a);i++){
			if(a[i]==a[i+1])
			count++;
			else{
				if(count==1)
				printf("%c",a[i]);
				else{
				printf("%d%c",count,a[i]);
				count=1;
				}
			}
		}
		printf("\n");
	}
	return 0;
}，C语言的基础太差啦，抓紧时间补基础，虽然不参加acm,还是要在杭电刷题。