HDU 1020 Encoding POJ 3438 Look and Say

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

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

 

 1 #include<iostream>
 2 using namespace std;
 3 
 4 int main(){  
 5     int t;  
 6     char str[10001];  
 7     scanf("%d",&t);  
 8     while(t--){  
 9         scanf("%s",str);  
10         int count=1;  
11         for(int i=0;i<strlen(str);i++){  
12             if(str[i]==str[i+1])count++;  
13             else{  
14                 if(count==1) printf("%c",str[i]);  
15                 else printf("%d%c",count,str[i]);  
16                 count=1;  
17             }  
18         }  
19         printf("\n");  
20     }  
21 } 

View Code