Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|
54273 | zhangweiran | 汉诺塔的移动过程 | C++ | Accepted | 27 MS | 244 KB | 812 | 2024-10-26 23:13:44 |
#include<bits/stdc++.h> using namespace std; int cnt=0; void move(char s,char t){ cout<<s<<"->"<<t<<endl; cnt++; } void hanoi(int n,char a,char b,char c){ if(n==1){ move(a,c); } else{ hanoi(n-1,a,c,b); move(a,c); hanoi(n-1,b,a,c); return; } } int main(){ int n; cin>>n; hanoi(n,'A','B','C'); cout<<cnt; return 0; }