pat1140 Look-and-say Sequence

题意：第n个字符串是第n-1个字符串的描述第n个字符串每两位a，b表示a这个字符连续出现了b次。

思路：模拟一下就好。

代码

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>

using namespace std;

const int MAX_N = 100000;
int len;
char s[MAX_N];
char tmp[MAX_N];
int n;

int main() {
    // freopen("in.txt", "r", stdin);
    // freopen("out.txt", "w", stdout);
    scanf("%s %d", s, &n);
    len = strlen(s);
    for (int i = 1; i < n; i++) {
        int la = s[0], ct = 1;
        int t = 0; len = strlen(s);
        for (int j = 1; j < len; j++) {
            if (s[j] == la) {
                ct++;
            } else {
                tmp[t++] = la; tmp[t++] = ct+'0'; la = s[j]; ct = 1;
            }
        }
        tmp[t++] = la; tmp[t++] = ct+'0'; tmp[t] = '\0';
        strcpy(s, tmp);
    }
    printf("%s\n", s);
    return 0;
}