```cpp void dfs(int u) { for (int v = 1; v <= 500; v++){ if (g[u][v]){ g[u][v]--,g[v][u]--; dfs(v); } } path[++ans]=u;//存路径，记得倒着输出！ return; } ``` by Ice_lift @ 2023-05-23 10:19:32