PTA 乙级 1084 外观数列

代码实现：

#include<stdio.h>
#include<string.h>

int main()
{
	int d, N;
	char str[100000];

	scanf("%d %d", &d, &N);
	str[0] = d + '0'; str[1] = 0;
	for (int i = 1; i < N; i++)
	{
		char str1[100000] = { 0 };
		int cnt = 0;
		for (int j = 0; str[j] != 0; j++)
		{
			if (str[j] != str[j + 1])
				str1[cnt++] = str[j], str1[cnt++] = '1';
			else
			{
				int count = 0, k;
				for (k = j; str[k] == str[j]; k++)
					count++;
				str1[cnt++] = str[j], str1[cnt++] = count + '0';
				j = k - 1;
			}
		}
		strcpy(str, str1);
	}
	puts(str);

	return 0;
}