Tower of Hanoi

Hard Recursion

Solve in Playground →

Problem Statement

Write a C++ recursive function to solve the Tower of Hanoi puzzle for N disks, printing each move.

Input Format

Number of disks N.

Output Format

Print each move in format 'Move disk X from A to B' on separate lines.

Constraints

1 <= N <= 5

Sample Input

Sample Output

Move disk 1 from A to B
Move disk 2 from A to C
Move disk 1 from B to C

Explanation

Classic recursive divide-and-conquer problem moving N-1 disks to auxiliary rod.

Starter Code

#include <iostream>

void hanoi(int n, char from, char to, char aux) {
    // Write your code here
}

int main() {
    int n;
    if (std::cin >> n) {
        hanoi(n, 'A', 'C', 'B');
    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

Start Coding in IDE →