[BOJ] 11729번 : 하노이 탑 이동순서

1. problem :

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

 

2. solution 1 :

#include <bits/stdc++.h>
using namespace std;

void hanoi(int a, int b, int n) {
	if (n == 1) {
		cout << a << ' ' << b << '\n';
		return;
	}
	hanoi(a, 6 - a - b, n - 1);
	cout << a << ' ' << b << '\n'; 
	hanoi(6 - a - b, b, n - 1);
}
int main(void) {
	int n;
	cin >> n;
	cout << (1 << n) - 1 << '\n';
	hanoi(1, 3, n);
	return 0;
}

< source code 출처 : https://github.com/encrypted-def/basic-algo-lecture/blob/master/0x0B/solutions/11729.cpp>

basic-algo-lecture/0x0B/solutions/11729.cpp at master · encrypted-def/basic-algo-lecture

외우자