Tower of Hanoi

Hard Recursion PRO

🔒 Login to Unlock

Problem Statement

Write a C program using recursion to solve the classic Tower of Hanoi puzzle, printing move steps.

Input Format

Number of disks N.

Output Format

Print each move format: 'Move disk X from A to B'.

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

Recursively move n-1 disks from source to auxiliary, move nth disk from source to destination, then move n-1 disks from auxiliary to destination.

Starter Code

#include <stdio.h>

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

int main() {
    int n;
    if (scanf("%d", &n) == 1) {
        hanoi(n, 'A', 'C', 'B');
    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

🔒 Login to Unlock