1140 Look-and-say Sequence

#include<iostream>
#include<string>
#include<vector>
using namespace std;
int main(){
    vector<string> a;
    string d;
    int n;
    cin>>d>>n;
    string t;
    a.push_back(d);
    for(int i=1;i<n;i++){
        int cnt=1;
        t=a[i-1];
        string temp;
        for(int i=0;i<t.length();i++){
        	if(t[i]==t[i+1]){
        		cnt++;
			}else{
				temp+=to_string((t[i]-'0')*10+cnt);
				cnt=1;
			}
		}
		a.push_back(temp);
    }
    cout<<a[n-1]<<endl;
    return 0;
}

猜你喜欢

转载自blog.csdn.net/csg3140100993/article/details/81366512