huanghai/python
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

'commit'

Browse Source
This commit is contained in:
HuangHai
2025-08-30 18:35:01 +08:00
commit 1f397eca87
6258 changed files with 1487241 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

37
C++专题课程/全排列/全排列_1.cpp Normal file
View File

@@ -0,0 +1,37 @@
//<2F><><EFBFBD><EFBFBD>һ<EFBFBD><D2BB><EFBFBD><EFBFBD>n(1<=n<=9)<29><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>1~n<><6E>ȫ<EFBFBD><C8AB><EFBFBD><EFBFBD>
#include<bits/stdc++.h>
int book[10];//<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>е<EFBFBD><D0B5><EFBFBD><EFBFBD><EFBFBD>
int array[10];//<2F><><EFBFBD><EFBFBD>
//<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ٸ<EFBFBD><D9B8><EFBFBD><EFBFBD><EFBFBD>ȫ<EFBFBD><C8AB><EFBFBD><EFBFBD>
int n;
//dfs<66><73><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
void dfs(int step)
{
if(step==n+1){
for(int i=1;i<=n;i++)
printf("%d%c",array[i],i==n?'\n':' ');
return;
}
for(int i=1;i<=n;i++){
if(book[i]==0){
array[step]=i;
book[i]=1;
dfs(step+1);
book[i]=0;
}
}
return;
}
int main()
{
//<2F><>ʼ<EFBFBD><CABC>book<6F><6B><EFBFBD><EFBFBD>
memset(book,0,sizeof(book));
//<2F><><EFBFBD>ո<EFBFBD><D5B8><EFBFBD>
scanf("%d",&n);
dfs(1);
return 0;
}