{"trustable":false,"sections":[{"title":"","value":{"format":"MD","content":"\n 奇怪的汉诺塔\n 四个塔,要求全部用上,把A上的塔转移到D上\n 12行依次输出12个数,第i行表示有i个塔在A上需要转移到D的最小次数\n\n 例子:n\u003d3时,可以把1个塔先转移到B,再把2个按照三诺塔形式花3步转移到D,再把第一个转移到D,最小步数为5"}},{"title":"Input","value":{"format":"MD","content":"\n 无"}},{"title":"Output","value":{"format":"MD","content":"\n 如题"}},{"title":"Sample Input","value":{"format":"MD","content":" 无"}},{"title":"Sample Output","value":{"format":"MD","content":" 无 "}}]}