解题思路:
用递归就好,话说一定注意空格
参考代码:
#include<bits/stdc++.h> #define hh ios::sync_with_stdio(false),cin.tie(0),cout.tie(0); using namespace std; void hannoi (int n, char A, char B, char C) { if (n == 1) { cout << "Move " << n << " from " << A << " to " << C << endl; } else { hannoi (n-1, A, C, B); cout << "Move " << n << " from " << A << " to " << C << endl; hannoi (n-1, B, A, C); } } int main() { hh; int n; cin >> n; hannoi (n, '1', '2', '3'); return 0; }
0.0分
0 人评分
Biggest Number (C++代码)回溯法浏览:1612 |
C语言训练-排序问题<1> (C++代码)浏览:589 |
【亲和数】 (C语言代码)浏览:855 |
C语言程序设计教程(第三版)课后习题4.9 (C语言代码)浏览:590 |
【蟠桃记】 (C语言代码)浏览:664 |
Wu-求圆的面积 (C++代码)浏览:1883 |
C语言程序设计教程(第三版)课后习题5.5 (C语言代码)浏览:552 |
C二级辅导-进制转换 (C语言代码)浏览:660 |
C二级辅导-分段函数 (C语言代码)浏览:593 |
陶陶摘苹果2 (C语言代码)浏览:595 |