#include<bits/stdc++.h>
using namespace std;
int main(void){
int D, N;
scanf("%d %d", &D, &N);
vector<int> va, vb;
va.push_back(D);
for(int i = 0; i < N-1; i++){
int p1 = 0, p2 = 0;
while(p1 < va.size()){
while(p2 < va.size() && va[p1] == va[p2]) p2++;
vb.push_back(va[p1]);
vb.push_back(p2-p1);
p1 = p2;
}
va = vb;
vb.clear();
}
for(int i = 0; i < va.size(); i++)
printf("%d", va[i]);
return 0;
}
PAT(A) 1140 Look-and-say Sequence (20 point(s))
最新推荐文章于 2023-03-26 13:37:37 发布