hanoi

#include <iostream>

using namespace std;


// про void и не void
int glo = 0;
bool fun1() {
    glo = 2;
    return true;
}
void test_fun() {
    if (fun1()) {
        cout << 1.0 / glo << endl;
    }
}

double power(double x, int n) {
    if (n == 0)
        return 1.0;
    if (n == 1)
        return x;
    return x * power(x, n - 1);
}

void test_power() {
    cout << "2^4 = " << power(2.0, 4) << endl; // 16
}

const int n = 3;
int a[n]{};
int b[n]{};
int c[n]{};

void init() {
    for (int k = 0; k < n; k++) {
        a[k] = k + 1;
    }
}

void show_tower(int *x) {
    cout << "(";
    for (int k = 0; k < n-1; k++) {
        cout << x[k] << ", ";
    }
    cout << x[n - 1];
    cout << ")";
}

void show_towers() {
    show_tower(a);
    cout << " ";
    show_tower(b);
    cout << " ";
    show_tower(c);
    cout << endl;
}

void move(int* from, int* to) {
    int k = 0;
    while (k < n && from[k] == 0)
        k++;
    int m = 0;
    while (m < n && to[m] == 0)
        m++;
    // пока не исправил
    if (k < n)
        if(m > 0 && from[k] < to[m]) {
            cout << to[m] << " " << from[k] << " ";
            to[m - 1] = from[k];
            from[k] = 0;
        }
}

bool is_good() {
    for (int k = 0; k < n-1; k++) {
        if (a[k + 1] < a[k] ||
            b[k + 1] < b[k] ||
            c[k + 1] < c[k])
            return false;
    }
    return true;
}

void hanoi() {
    init();
    //cout << is_good();
    show_towers();


    move(a, c);
    //cout << is_good();
    show_towers();

    move(a, c);
    //cout << is_good();
    show_towers();

    move(b, c);
    //cout << is_good();
    show_towers();

}

int main() {
    //test_power();
    hanoi();
    return 0;
}