Run ID Author Problem Lang Verdict Time Memory Code Length Submit Time
89740 sh25_shengmy 汉诺塔的移动过程 C++ Accepted 26 MS 248 KB 509 2026-06-05 14:46:00

Tests(3/3):


#include <iostream> using namespace std; int hanoi(int n, char from, char to, char aux) { if (n == 1) { cout << from << "->" << to << endl; return 1; } int count = 0; count += hanoi(n - 1, from, aux, to); cout << from << "->" << to << endl; count++; count += hanoi(n - 1, aux, to, from); return count; } int main() { int n; cin >> n; int total_moves = hanoi(n, 'A', 'C', 'B'); cout << total_moves << endl; return 0; }


Judgement Protocol: