HDOJ 1012 Encoding

最新推荐文章于 2023-05-07 20:27:34 发布

kdwycz

最新推荐文章于 2023-05-07 20:27:34 发布

阅读量385

点赞数

分类专栏：【OJ】水题文章标签： encoding Encoding HDOJ 1012

本文链接：https://blog.csdn.net/kdwycz/article/details/8590444

版权

【OJ】水题专栏收录该内容

27 篇文章 0 订阅

订阅专栏

Encoding

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

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

纯水题，不解释。。。NOIP2007提高组第二题比这个麻烦多了

#include <iostream>
using namespace std;
int main(int argc, char *argv[])
{
	string s; int ii,n;
	cin>>n;
	for (int i=0;i<n;++i){
		cin>>s; 
		for (int j=0;j<s.length();++j){
			ii=1;
			while ((s[j+1]==s[j])&&(j<s.length()-1)){
				++j; ++ii;
			}
			if (ii>1) cout<<ii;
			cout<<s[j];
		}
	cout<<endl;
	}
	return 0;
}

kdwycz的网站： http://kdwycz.com/

kdwyz的刷题空间：http://blog.csdn.net/kdwycz