ACM02.docVIP

附件2 竞赛题目（中文）示例 Problem A：新汉诺塔 Time Limit: 3000ms , Memory Limit: 10000KB 标准的汉诺塔上有n个大小各异的盘子。给定一个初始局面（如图A），求它到给定目标局面（如图B）至少需要多少步。移动规则如下：一次只能移动一个盘子，在移动一个盘子之前，必须把压在上面的其他盘子先移走；编号大的盘子不得压在编号小的盘子之上。 A B 输入 输入包含不超过100组数据。每组数据的第1行为正整数n（1≤n≤60），第2行包含n个1～3的整数，即初始局面中每个盘子所在的柱子编号，第3行与第2行格式相同，为目标局面。EOF结束。 输出 对每组数据，输出最小步数。 输入样例 3 1 1 1 2 2 2 3 1 2 3 3 2 1 输出样例 7 3 提示：以EOF结尾的数据输入判断方式为： C C++ while scanf %d,n ! EOF while cin n 竞赛题目（英文）示例 Problem A：New Hanoi Time Limit: 3000ms , Memory Limit: 10000KB The Three peg Tower of Hanoi problem is a popular one in computer science. Briefly the problem is to transfer all the disks from peg-A to peg-C using peg-B as intermediate one in such a way that at no stage a larger disk is above a smaller disk. Normally, we want the minimum number of moves required for this task. The problem is used as an ideal example for learning recursion. It is so well studied that one can find the sequence of moves for smaller number of disks such as 3 or 4. A trivial computer program can find the case of large number of disks also.Here we have made your task little bit difficult by making the problem more flexible. Here the disks can be in any peg initially. If more than one disk is in a certain peg, then they will be in a valid arrangement larger disk will not be on smaller ones . We will give you two such arrangements of disks. You will have to find out the minimum number of moves, which will transform the first arrangement into the second one. Of course you always have to maintain the constraint that smaller disks must be upon the larger ones. A B Input The input file contains at most 100 test cases. Each test case starts with a positive integer N 1≤N≤60 , which means the number of disks. You will be given the arrangements in next two lines. Each arrangement will be represented by N integers, which are 1, 2 or 3. If the i-th 1≤i≤N integer is 1, you should consider that i-th disk is on Peg-A. Input is terminated by EOF. Output Output of each test ca