Tower of Hanoi: How Many Moves
Print the minimum number of moves to transfer an N-disc Tower of Hanoi.
Input: one integer N.
Output: 2N − 1.
Constraints:
- 1 ≤ N ≤ 62
Sample Tests
Input 1
3
Output 1
7
Input 2
1
Output 2
1
Discussion (opens after you solve — no spoilers before)
No comments yet.