#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
int a[10][3] = { 0 };
void show(int a[10][3])
{
printf("%5c%5c%5c\n", 'A', 'B', 'C');
printf("---------------------\n");
for (int i = 0;i < 10;i++)
{
for (int j = 0;j < 3;j++)
{
printf("%5d", a[i][j]);
}
printf("\n");
}
}
void move(char X, char Y) {
int m = X - 65; //[9][0]
int n = Y - 65; // [9][n]
int imove = -1;
for (int i = 0;i < 10;i++)
{
if (a[i][m] != 0)
{
imove = i;
break;
}
}
//a[imove][m]
//a[jmove][n]
int jmove;
if (a[9][n] == 0) {
jmove = 9;
}
else {
jmove = 10;
for (int i = 0;i < 10;i++) {
if (a[i][n] != 0) //检索第一个不为0的情况
{
jmove = i;
break;
}
}
jmove -= 1;
}
//交换数据
int temp = a[imove][m];
a[imove][m] = a[jmove][n];
a[jmove][n] = temp;
}
void hanno(int n, char A, char B, char C) {
if (n < 1)
{
return;
}
else if (n == 1) {
printf("%c->%c\n", A, C);
move(A, C);
show(a);
}
else {
//处理N的情况
hanno(n - 1, A, C, B);
printf("%c->%c\n", A, C);
move(A, C);
show(a);
hanno(n - 1, B, A, C);
}
}
void main()
{
int n = 0;
scanf("%d", &n);
for (int i = 0;i < n;i++)
{
a[10 - 1 - i][0] = n - i;
}
show(a);
hanno(n, 'A', 'B', 'C');
system("pause");
}
输入n
下面输入2
2
A B C
---------------------
0 0 0
0 0 0
0 0 0
0 0 0
0 0 0
0 0 0
0 0 0
0 0 0
1 0 0
2 0 0
A->B
A B C
---------------------
0 0 0
0 0 0
0 0 0
0 0 0
0 0 0
0 0 0
0 0 0
0 0 0
0 0 0
2 1 0
A->C
A B C
---------------------
0 0 0
0 0 0
0 0 0
0 0 0
0 0 0
0 0 0
0 0 0
0 0 0
0 0 0
0 1 2
B->C
A B C
---------------------
0 0 0
0 0 0
0 0 0
0 0 0
0 0 0
0 0 0
0 0 0
0 0 0
0 0 1
0 0 2
转载地址:https://edu.51cto.com/center/course/lesson/index?id=628376