| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 333284 | 孙一铭 | 【C6-6】汉诺塔 | C++ | Wrong Answer | 0 | 2 MS | 260 KB | 462 | 2025-07-16 11:11:31 |
#include <iostream> using namespace std; int hanoi(int n, char src, char dst, char tmp) { int s = 0; if (n == 1) { cout << src << "->" << dst << endl; return 1; } s += hanoi(n-1, src, tmp, dst); cout << src << "->" << dst << endl; s++; s += hanoi(n-1, tmp, dst, src); return s; } int main() { int n; cin >> n; cout << "Total steps: " << hanoi(n, 'A', 'C', 'B'); return 0; }