UVA Solution 254 - Towers of Hanoi - Solution in C++ | Volume 2

UVA Solution 254 - Towers of Hanoi - Solution in C++ | Volume 2

UVA Online Judge Solution 254 - Towers of Hanoi | Volume 2
UVA Problem Link - 254 - Towers of Hanoi https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=4&page=show_problem&problem=190

Problem Name: 254 - Towers of Hanoi
Problem Number : UVA - 254 - Towers of Hanoi
Online Judge : UVA Online Judge Solution
Volume: 2
Solution Language : C plus plus

UVA Solution 254 - Towers of Hanoi Code in CPP:

#include <stdio.h>
int peg[3];
int n, m, flag;
void h(int n, int A, int B, int C) {
    if(flag)    return;
    if(m == 0) {
        printf("%d %d %d\n", peg[0], peg[2], peg[1]);
        flag = 1;
    }
    if(n > 0) {
        if(m > (1<<(n-1))-1) {
            m -= (1<<(n-1))-1;
            peg[A] -= n-1;
            peg[B] += n-1;
        } else
            h(n-1, A, C, B);
        m--;
        peg[A]--, peg[C]++;
        if(m > (1<<(n-1))-1) {
            m -= (1<<(n-1))-1;
            peg[B] -= n-1;
            peg[C] += n-1;
        } else
            h(n-1, B, A, C);
    }
}
int main() {
    while(scanf("%d %d", &n, &m) == 2) {
        if(n == 0)  break;
        flag = 0;
        peg[0] = n, peg[1] = peg[2] = 0;
        h(n, 0, 1, 2);
    }
    return 0;
}