1140 Look-and-say Sequence （20 分）(cj)_1140 look-and-say sequence c语言-CSDN博客

本文链接：https://blog.csdn.net/Cute_jinx/article/details/82686533

本文介绍了一个特殊的整数序列——Look-and-say序列，并提供了一段C++代码来生成给定数字D的第N个Look-and-say序列。通过输入一个0到9之间的数字D及一个正整数N，程序能够计算并输出该序列的第N项。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

code

#pragma warning(disable:4996)
#include <iostream>
#include <string>
using namespace std;
string tran(int x);
int main() {
	string s,res;
	
	int n;
	cin >> s >> n;
	for (int i = 0; i < n-1; ++i) {
		char c=s[0];
		res = "";
		int num = 0;
		for (int j = 0; j < s.size(); ++j) {
			if (s[j] == c) num++;
			else {
				res += c;
				res += tran(num);
				c = s[j];
				num = 1;
			}
		}
		res += c;
		res += tran(num);
		s = res;
	}
	cout << s << endl;
	system("pause");
	return 0;
}
string tran(int x) {
	string s;
	while (x) {
		s += (x % 10 + '0');
		x /= 10;
	}
	return string(s.rbegin(), s.rend());
}