HDU_1020Encoding

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

2ABCABBCCC

 

Sample Output

ABCA2B3C

代码：

#include<iostream>#include<stdio.h>#include<string.h>using namespace std;int main(){    int n,i,cnt;      char str[10005];      cin >> n;           while(n--)      {          cin >> str; int a = strlen(str);        for(i = 0; i < a;)          {              cnt = 1;              while(str[i] == str[i+1])              {                  cnt++;                  i++;              }              if(cnt == 1)              cout << str[i];              else              cout << cnt << str[i];              i++;          }          cout << endl;      }        return 0;  }  

思路解析：
思路很明显，如果相同就计数加“1”，输出计数结果和字符，否则只输出字符。。。
                                             
        0        0           
	
				
	
					   
HDU_1020Encoding
	  	   
HDU_1020Encoding
	     		  
	  	   
Pat(Advanced Level)Practice--1073(Scientific Notation)
	  	   
C语言未定义行为
	  	   
延迟系统时间但系统又能同时能执行其它任务
	  	   
gpu简介
	  	   
iframe 无刷新提交表单
	  	   
HDU_1020Encoding
	  	   
lex   demo
	  	   
[LeetCode]14.Longest Common Prefix
	  	   
Android下HelloWorld项目的R.java文件介绍
	  	   
MSSQL 事务级别
	  	   
Swing JComboBox的详细使用
	  	   
extjs环境搭建
	  	   
Pat(Advanced Level)Practice--1074(Reversing Linked List)
	  	   
排序之归并排序