Tower of Hanoi

Problem Statement

Input Format

A single integer N representing the number of disks.

Output Format

Print the sequence of moves in format 'Move disk X from A to B'.

Constraints

1 <= N <= 10

Sample Input

2

Sample Output

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

Explanation

Standard recursive solution for 2 disks moving from rod A to C via B.

Starter Code

#include <stdio.h>

void towerOfHanoi(int n, char from_rod, char to_rod, char aux_rod) {
    // Write recursive logic here
}

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

Limits

• Time Limit: 1s
• Memory Limit: 256MB