Computer Transformation UVA - 1647

可以发现00经过两次变换会继续产生00，1经过两次变换也会产生00，所以就有相应的递推关系的出现，每次的1的个数均为上次的1的个数的两倍，其他的编程实现即可，具体代码如下：

#include<iostream>
#include<vector>
#include<string>
#include<set>
#include<stack>
#include<queue>
#include<map>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<cstring>
#include<sstream>
#include<cstdio>
#include<deque>
#include<functional>
using namespace std;

int n;

int d_zero[1001][100];//双0的个数
int one[1001][100];//单1的个数

int main(){
	memset(d_zero, 0, sizeof(d_zero));
	memset(one, 0, sizeof(one));
	one[0][0] = 1; one[1][0] = 1;
	for (int i = 2; i < 1001; i++){//变换的次数
		for (int k = 0; k < 99; k++){
			d_zero[i][k]+= d_zero[i - 2][k] + one[i - 2][k];
			one[i][k] += one[i - 1][k] + one[i - 1][k];
			d_zero[i][k + 1] += d_zero[i][k] / 10000;
			d_zero[i][k] %= 10000;
			one[i][k + 1] += one[i][k] / 10000;
			one[i][k] %= 10000;
		}
	}
	while (cin >> n){
		int ind = 99;
		while (d_zero[n][ind] == 0&&ind>0) ind--;
		printf("%d", d_zero[n][ind--]);
		while (ind >= 0){
			printf("%04d",d_zero[n][ind]);
			ind--;
		}
		cout << endl;
	}
	return 0;
}