标签：while using sts nta his NPU hat name pos
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
1 #include<iostream> 2 #include<string> 3 using namespace std; 4 int main(){ 5 int d, n; 6 string s=""; 7 cin>>d>>n; 8 char dig[]={‘0‘,‘1‘,‘2‘,‘3‘,‘4‘,‘5‘,‘6‘,‘7‘,‘8‘,‘9‘}; 9 s += dig[d]; 10 for(int i=1; i<n; i++){ 11 string s1=""; 12 char ch=s[0]; 13 int begin=0; 14 for(int j=0; j<s.size();){ 15 while(s[j]==ch){j++;} 16 int len=j-begin; 17 begin=j; 18 s1 += ch; 19 s1 += dig[len]; 20 ch = s[j]; 21 } 22 s = s1; 23 } 24 cout<<s<<endl; 25 return 0; 26 } 27
1140 Look-and-say Sequence (20)
标签：while using sts nta his NPU hat name pos
原文地址：https://www.cnblogs.com/mr-stn/p/9165060.html
