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

47
C++课程/待整理知识/啊哈算法/p131.cpp Normal file
View File

@@ -0,0 +1,47 @@
#include <stdio.h>
int e[100][100], book[100], n, sum = 0;
void dfs(int cur) {//cur<75>ǵ<EFBFBD>ǰ<EFBFBD><C7B0><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
int i;
printf("%d ", cur);
sum++;//ÿ<><C3BF><EFBFBD><EFBFBD>һ<EFBFBD><D2BB><EFBFBD><EFBFBD><EFBFBD>㣬sum<75>ͼ<EFBFBD>һ<EFBFBD><D2BB>
// <20>߽<EFBFBD>
if (sum == n) {//<2F><><EFBFBD>ж<EFBFBD><D0B6>㶼<EFBFBD>Ѿ<EFBFBD><D1BE><EFBFBD><EFBFBD>ʹ<EFBFBD><CAB9><EFBFBD>ֱ<EFBFBD><D6B1><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
return;
}
// <20><><EFBFBD><EFBFBD>ÿһ<C3BF><D2BB>
for (i = 1; i <=n; i++) {//<2F><>1<EFBFBD>Ŷ<EFBFBD><C5B6>㵽n<E3B5BD>Ŷ<EFBFBD><C5B6><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ν<EFBFBD><CEBD>г<EFBFBD><D0B3>ԣ<EFBFBD><D4A3><EFBFBD><EFBFBD><EFBFBD>Щ<EFBFBD><D0A9><EFBFBD><EFBFBD><EFBFBD>뵱ǰ<EBB5B1><C7B0><EFBFBD><EFBFBD>cur<75>б<EFBFBD><D0B1><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
// //<2F>жϵ<D0B6>ǰ<EFBFBD><C7B0><EFBFBD><EFBFBD>cur<75><72><EFBFBD><EFBFBD><EFBFBD><EFBFBD>i<EFBFBD>Ƿ<EFBFBD><C7B7>бߣ<D0B1><DFA3><EFBFBD><EFBFBD>Ҷ<EFBFBD><D2B6><EFBFBD>i<EFBFBD>Ƿ<EFBFBD><C7B7>ѷ<EFBFBD><D1B7>ʹ<EFBFBD><CAB9><EFBFBD>
if (e[cur][i] == 1 && book[i] == 0) {
book[i] = 1;//<2F><><EFBFBD>Ƕ<EFBFBD><C7B6><EFBFBD>i<EFBFBD>Ѿ<EFBFBD><D1BE><EFBFBD><EFBFBD>ʹ<EFBFBD><CAB9><EFBFBD>
dfs(i);//<2F>Ӷ<EFBFBD><D3B6><EFBFBD>i<EFBFBD>ٳ<EFBFBD><D9B3><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
}
}
return;
}
int main() {
int i, j, m, a, b;
scanf("%d %d", &n, &m);
//<2F><>ʼ<EFBFBD><CABC><EFBFBD><EFBFBD>ά<EFBFBD><CEAC><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
if (i == j) e[i][j] = 0;
else e[i][j] = 999999;//<2F>൱<EFBFBD><E0B5B1><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
// <20><>λ<EFBFBD><CEBB><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Խ<EFBFBD><D4BD>߶Գƣ<D4B3><C6A3><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ͼ
for (i = 1; i <= m; i++) {
scanf("%d %d", &a, &b);
e[a][b] = 1;
e[b][a] = 1;//<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ͼ<EFBFBD><CDBC><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ҫ<EFBFBD><D2AA>e[b][a]Ҳ<><D2B2>ֵΪ1<CEAA><31>
}
//<2F><>1<EFBFBD>Ŷ<EFBFBD><C5B6><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
book[1] = 1;//<2F><><EFBFBD><EFBFBD>1<EFBFBD>Ŷ<EFBFBD><C5B6><EFBFBD><EFBFBD>Ѿ<EFBFBD><D1BE><EFBFBD><EFBFBD>ʹ<EFBFBD><CAB9><EFBFBD>
dfs(1);//<2F><>1<EFBFBD>Ŷ<EFBFBD><C5B6>㿪ʼ<E3BFAA><CABC><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
getchar();
getchar();
return 0;
}