| Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|
| 31080 | diandian | 汉诺塔问题 | C++ | Accepted | 0 MS | 248 KB | 310 | 2023-11-14 20:56:54 |
#include <bits/stdc++.h> using namespace std; void hanoi (int n, char a, char b, char c) { if (n == 0) return ; hanoi (n - 1, a, c, b); printf ("%c->%d->%c\n", a, n, b); hanoi (n - 1, c, b, a); } int main() { int n; char a, b, c; cin >> n >> a >> b >> c; hanoi(n, a, b, c); return 0; }