HDU-2154跳舞毯

递推每次只有2种可能

step[n]=step_b[n-1]+step_c[n-1];

#include<iostream>

#define N 1005
int  step[N];
int  step_b[N];
int  step_c[N];
int n;

int main()
{
	step[0]=0;
	step[1]=0;
	step_b[0]=0;step_b[1]=1;
	step_c[0]=0;step_c[1]=1;
	for(int i=2;i!=1001;i++){
			step[i]=(step_b[i-1]+step_c[i-1])%10000;
			step_b[i]=step[i-1]+step_c[i-1]%10000;
			step_c[i]=step[i-1]+step_b[i-1]%10000;
		}
	while (std::cin>>n&&n!=0){
		std::cout<<step[n]<<std::endl;
	}
}