fenychn0206/OI-Codes
1
0
Fork 0
mirror of https://github.com/wczffl-503/OI-Codes.git synced 2025-07-08 02:13:51 +08:00
Code Issues Packages Projects Releases Wiki Activity

归类了 OJ，整理了一下

Browse Source
This commit is contained in:
Fengyi Chen
2024-02-15 22:38:30 +08:00
parent 76c1ecea65
commit 8dbc0861b2
231 changed files with 0 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

30
XSM OJ 重庆小码王集团OJ/hanoi(汉诺塔).cpp Normal file
View File

@ -0,0 +1,30 @@
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <cstdio>
#include <stack>
#include <ctime>
#include <cmath>
#include <queue>
typedef long long l;
typedef double d;
typedef char c;
using namespace std;
void s(char a,char b,char c,int n){
//<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>a<EFBFBD><61>ʾ<EFBFBD><CABE>ʼ<EFBFBD><CABC><EFBFBD><EFBFBD>b<EFBFBD><62>ʾ<EFBFBD><CABE><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>c<EFBFBD><63>ʾĿ<CABE><C4BF><EFBFBD><EFBFBD><EFBFBD><EFBFBD>n<EFBFBD><6E>ʾ<EFBFBD><CABE><EFBFBD><EFBFBD>
if(n==1){
printf("%c->%c\n",a,c);//<2F>ݹ鵽1<E9B5BD><31><EFBFBD><EFBFBD><EFBFBD>ӣ<EFBFBD>ֱ<EFBFBD>Ӵ<EFBFBD><D3B4><EFBFBD>ʼ<EFBFBD><CABC><EFBFBD><EFBFBD>Ŀ<EFBFBD><C4BF><EFBFBD><EFBFBD>
return;
}
s(a,c,b,n-1);//<2F>Ƚ<EFBFBD>n-1<><31> <20><>A<EFBFBD><41>B
printf("%c->%c\n",a,c);
s(b,a,c,n-1);//<2F>ٽ<EFBFBD>n-1<><31> <20><>B<EFBFBD><42>C
}
int main(){
char a,b,c;
int d;
cin >>d>>a>>b>>c;
s(a,b,c,d);
return 0;
}