HDU-ACM1020

Encoding

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

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;

class Main{
    public static void main(String[] args) {
        Scanner input=new Scanner(System.in);
        int n=input.nextInt();
        while (n-->0){
        	String str=input.next();
        	char ch[]=str.toCharArray();
        	int t=0,c=1;
        	for (int i=1;i<ch.length;i++){
        		if (t==ch.length-1){
        			System.out.println(ch[t]);
        			break;
        		}
        		if (ch[t]==ch[i]){
        			c++;
        			if (i==ch.length-1){
        				System.out.println(c+""+ch[t]);break;
        			}
        		}else {
        			if (c>1){
        				System.out.print(c+""+ch[t]);
        				if (i==ch.length-1){
        					System.out.println(ch[i]);break;
        				}
        			}else {
        				System.out.print(""+ch[t]);
        				if (i==ch.length-1){
        					System.out.println(ch[i]);break;
        				}
        			}
        			t+=c;
        			c=1;
        		}
        	}
        }
    }
}