题目链接很O_O的汉诺塔.
题目:
分析:
分析链接.
AC代码(JAVA)
package Two;
import java.util.Scanner;
public class 很O_O的汉诺塔 {
public static int MOD=20090308;
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int[]a=new int[1005];
int[]b=new int[1005];
int[]c=new int[1005];
int[]d=new int[1005];
while(sc.hasNext()){
int n=sc.nextInt();
int m=sc.nextInt();
if(m==1){
a[1]=2;
for(int i=2;i<=n;i++){
a[i] =( 2 * a[i-1]+ 2* a[i-2]+3 ) % MOD;
}
}
else{
a[1]=b[1]=c[1]=2*m;
d[1]=m;
for(int i=2;i<=n;i++){
d[i]= ( 2*b[i-1]+ m ) % MOD;
b[i]= ( 2*b[i-1]+2*m+d[i-1] ) % MOD;
if(m==2)
c[i]=( 2* b[i-1]+ 4+ 2* d[i-1]+2* b[i-2] + 4+2* d[i-2] +a[i-2] ) %MOD;
else
c[i]=( b[i-1]+ m+4*(d[i-1]+m)+c[i-1] ) % MOD;
a[i]= ( b[i-1]+ d[i-1]+ c[i-1]+2*m ) % MOD;
}
}
System.out.println(a[n]);
}
}
}