【2019暑期】【PAT甲级】1140 Look-and-say Sequence (20 分)

读题读了很久

#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <iostream>
#include <string>
#include <cctype>
#include <vector>
#include <cmath>
#include <map> 
#include <set>
using namespace std;

int d,n;
string ans,fin;

int main(){
	
	cin >> d >> n;
	ans = (char)(d+'0');
	for(int i=1; i<n; i++){
		int num = 1;
		fin = "";
		for(int j=0; j<ans.length(); j++){		
			if(j+1<ans.length() && ans[j] == ans[j+1]){
				num++;
			}
			else{
				fin += ans[j];
				fin += (char)(num+'0');
				num = 1;
				
			}	
		}
		ans = fin;
	}
	cout << ans << endl;
	return 0;
}