漢諾塔問題C++實現

#include<iostream>
using namespace std;
void move(int n, char a, char b, char c);
int i = 1;
int main()
{
    int num;
    cout << "輸入圓盤的個數:";
    cin >> num;
    move(num, 'A', 'B', 'C');
    system("pause");
    return 0;
}
void move(int n,char a,char b,char c)
{
    if (n == 1)
    {            
        cout << "第"<<i++<<"步，將第" << n << "個從" << a << "移動到" << c<<endl;
    }
    else
    {
        move(n - 1, a, c, b);
        cout << "第" << i++ << "步，將第" << n << "個從" << a << "移動到" << c << endl;
        move(n - 1, b,a, c);
    }     
}