[백준][Python] 11729번 하노이탑 이동 순서 - 재귀(하노이탑)

https://www.acmicpc.net/problem/11729

11729번: 하노이 탑 이동 순서

 

 

 

Python

import sys
n = int(sys.stdin.readline().rstrip())

ans = []
def hanoi(start,thor,dest,n):
    global ans
    if n <= 0:
        return

    #1 -> 3 -> 2
    hanoi(start, dest, thor,  n-1)
    ans.append(str(start)+" "+str(dest))
    #2 -> 1 -> 3
    hanoi(thor, start, dest, n-1)
   
hanoi(1,2,3,n)
print(len(ans))
print("\n".join(ans))

 

 

정리본

import sys
n = int(sys.stdin.readline().rstrip())

ans = []
def hanoi(start,dest,n):
    global ans
    if n <= 0:
        return

    hanoi(start, 6-(start+dest),  n-1)
    ans.append(str(start)+" "+str(dest))
    hanoi(6-(start+dest),dest, n-1)
   
hanoi(1,3,n)
print(len(ans))
print("\n".join(ans))