hdu 1020 Encoding

Encoding

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

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
  
  
  
  


  
  
  
  

   
   简单题
  
  
  
  


  
  
  
  

   
   


import java.util.Scanner;


public class Main{



   
   	/**

   
   	 * @param args

   
   	 */

   
   	public static void main(String[] args) {

   
   		// TODO Auto-generated method stub

   
   		Scanner scan=new Scanner(System.in);

   
   		int t;

   
   		t=scan.nextInt();

   
   		for(int i=0;i<t;i++){

   
   			int count=1;

   
   			 String str=scan.next();

   
   			 char b[]=str.toCharArray();

   
   			 char a[]=new char[str.length()+1];

   
   			

   
   			 for(int k=0;k<a.length;k++){

   
   				 if(k!=(a.length-1)){

   
   					 a[k]=b[k];

   
   				 }

   
   				 else{

   
   					 a[k]='#'; 

   
   				 }

   
   					 

   
   			 }

   
   			 for(int j=1;j<a.length;j++){

   
   				 if(a[j]==a[j-1]){

   
   					 count++;

   
   					 

   
   				 }else{

   
   					 if(count==1){

   
   						 System.out.print(a[j-1]);

   
   					 }else{

   
   						 

   
   						 System.out.print(count+""+a[j-1]);

   
   						 count=1;

   
   					 }

   
   				 }

   
   			 }

   
   			 System.out.println();

   
   		}

   
   	}


}