原题链接

#include <algorithm>
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
using namespace std;

const int MAX = 10010;

int N, c = 0;
void Hanoi(int n, char x, char y, char z)
{
    if(n == 1)
    {
        printf("%2d. Move disk %d from %c to %c\n", ++c, n, x, z);
    }
    else
    {
        Hanoi(n-1, x, z, y);
        printf("%2d. Move disk %d from %c to %c\n", ++c, n, x, z);
        Hanoi(n-1, y, x, z);
    }
}

int main()
{
    while(scanf("%d", &N) != EOF)
    {
        c = 0;
        Hanoi(N, 'X', 'Y', 'Z');
        printf("\n");
    }
	return 0;
}