解题思路:
用递归就好,话说一定注意空格
参考代码:
#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 人评分