PAT Advanced 1140 Look-and-say Sequence (20 分)
Look-and-say sequence is a sequence of integers as the following:
D, D1, D111, D113, D11231, D112213111, ...
where D
is in [0, 9] except 1. The (n+1)st number is a kind of description of the nth number. For example, the 2nd number means that there is one D
in the 1st number, and hence it is D1
; the 2nd number consists of one D
(corresponding to D1
) and one 1 (corresponding to 11), therefore the 3rd number is D111
; or since the 4th number is D113
, it consists of one D
, two 1's, and one 3, so the next number must be D11231
. This definition works for D
= 1 as well. Now you are supposed to calculate the Nth number in a look-and-say sequence of a given digit D
.
Input Specification:
Each input file contains one test case, which gives D
(in [0, 9]) and a positive integer N (≤ 40), separated by a space.
Output Specification:
Print in a line the Nth number in a look-and-say sequence of D
.
Sample Input:
1 8
Sample Output:
1123123111
乙级真题
#include <iostream>
using namespace std;
string coun(string str){
string res="";int coun=;
for(int i=;i<str.length();i++){
if(str[i]==str[i-]) coun++;
else {
res+=(str[i-]);
res+=(coun+'');
coun=;
}
}
res+=str[str.length()-];res+=(coun+'');
return res;
}
int main()
{
string A;int B;
cin>>A>>B;
for(int i=;i<B;i++) A=coun(A);
cout<<A;
system("pause");
return ;
}
最新文章
- 让你的web程序“动”起来。
- MySQL字符集转换(latin1到utf8)
- Android手机编程初学遇到的问题及解决方法
- 8-Highcharts曲线图之对数直线图
- WPF之TextBox
- Dalvik opcodes
- devexpress 控制面板汉化方式 参考信息
- openerp经典收藏 OpenERP库存管理的若干概念讲解(新增库存价值)(转载)
- 6 个基于 jQuery 的表单向导插件推荐
- Haxe数据类型
- <;三>;面向对象分析之UML核心元素之参与者
- 我用dedecms有感
- linux编辑器 vi的使用
- [转]学好Mac常用命令,助力iOS开发
- Netbeans文件被误删怎么办?
- c# 使用资源文件
- python之list+字典练习
- Python events
- PythonStudy——字符串重要方法 String important method
- 小波变换——哈尔小波,Haar