HDOJ 1020 Encoding

Encoding

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

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
  
  

 

Author

ZHANG Zheng

 

Recommend

JGShining   |   We have carefully selected several similar problems for you:   1008  1004  1002  1019  1021

注意是数字在前，字母在后
注意数字必须用%d输出
注意使用getchar
注意题目的数据范围
还有就是看清题意，不用排序

 

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
int main(){
	int n,len,t,sum[10000],i;
	char a[10000];
	scanf("%d\n",&n);
	while(n--){
		memset(a,10000,sizeof(a));
		gets(a);
		len=strlen(a);
		t=0;
		memset(sum,0,sizeof(sum));
		for(i=1;i<=len;i++){
			if(a[i]==a[i-1]) sum[t]++;
			else if(sum[t]==0) {printf("%c",a[i-1]); t++;}
			else{
				printf("%d%c",sum[t]+1,a[i-1]);t++;
			}
		}
		printf("\n");
	}
	return 0;
}