1140. Look-and-say Sequence (20)

1140. Look-and-say Sequence (20)

时间限制

400 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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

        比如给一个数5，第一个数就是5，

        第二个数是：前一个数先是一个5，所以51；

        第三个数：前一个数先是一个5，所以先51，然后一个1，所以再加一个11，就是5111；

        第四个数：前一个数先是一个5，所以先51，然后三个1，所以再加一个13，就是5113；

        以此类推，关键看明白意思。写起来不难。

#include <cstdio>
#include <vector>
#include <algorithm>

using namespace std;

int D, N;

void cal(int dp, vector<int>&ans) {
	if (dp == N)return;
	vector<int>ans2;
	ans2.push_back(ans[0]);
	ans2.push_back(1);
	int p = 1;
	while (p < ans.size()) {
		if (ans[p] == ans[p - 1]) {
			ans2[ans2.size() - 1]++;
		}
		else {
			ans2.push_back(ans[p]);
			ans2.push_back(1);
		}
		p++;
	}
	ans = ans2;
	cal(dp + 1, ans);
}

int main() {
	scanf("%d %d", &D, &N);
	vector<int>ans;
	ans.push_back(D);
	int dp = 1;
	cal(dp, ans);
	for (int i = 0; i < ans.size(); i++) {
		printf("%d", ans[i]);
	}
	return 0;
}