摘要: #include <iostream> #include <algorithm> using namespace std; const int N = 10; int n; int path[N]; void dfs(int sum, int start, int k) { if(sum == n) 阅读全文
posted @ 2022-12-21 15:34 Pamper/ 阅读(22) 评论(0) 推荐(0)