poj 3572 Hanoi Tower

Hanoi Towers

Time Limit : 10000/5000ms (Java/Other) Memory Limit : 131072/65536K (Java/Other)

Total Submission(s) : 0 Accepted Submission(s) : 0

Special Judge

Problem Description

The “Hanoi Towers” puzzle consists of three pegs (that we will name A, B, and C) with n disks of different diameters stacked onto the pegs. Initially all disks are stacked onto peg A with the smallest disk at the top and the largest one at the bottom, so that they form a conical shape on peg A.

 

Input

The input file contains two lines. The first line consists of a single
integer number n (1 ≤ n ≤ 30) the number of disks in the puzzle.
The second line contains descriptions of six moves separated by spaces the
strategy that is used to solve the puzzle.

 

Output

Write to the output file the number of moves it takes to solve the puzzle.
This number will not exceed 10¹⁸.

 

Sample Input

#1	3 AB BC CA BA CB AC
#2	2 AB BA CA BC CB AC

 

Sample Output

#1	7
#2	5

 

 

貌似是一道纯规律的题，我不会做。。。照着网上的规律敲了一遍，感觉网上的大神真厉害。

 

题意：对于一个汉诺塔，每次按照给定的顺序，找第一个可以移动的方式去移动。要求不能大的下面放小的，且不能连续两次移动同一个盘子。

 

附上代码：

 #include<cstdio>
 #include<cstring>
 using namespace std;
 typedef long long ll;
 ll a[],b[],c[];
 int num[];
 char s[];
 int main()
 {
     int n,i,j,k;
     a[]=b[]=c[]=;
     for(i=; i<=; i++)
     {
         a[i]=a[i-]*+;
         c[i]=c[i-]*+;
         b[i]=b[i-]+c[i-]+;
     }
     scanf("%d",&n);
     for(i=; i<=; i++)
     {
         scanf("%s",s);
         k=(s[]-'A')*+s[]-'A';
         num[k]=i;
     }
     if(num[]<num[])
     {
         if(num[]<num[])
             printf("%I64d\n",c[n]);
         else if(num[]<num[])
             printf("%I64d\n",b[n]);
         else
             printf("%I64d\n",a[n]);
     }
     else
     {
         if(num[]<num[])
             printf("%I64d\n",c[n]);
         else if(num[]<num[])
             printf("%I64d\n",b[n]);
         else
             printf("%I64d\n",a[n]);
     }
 }