深度优先搜索DFS

给个k，再给n个数，看能不能凑出k

#include <cstdio>using namespace std;int n, k, Lu[10001];bool dfs(int i, int sum){if (i == n + 1)return sum == k;if (dfs(i + 1, sum))return true;if (dfs(i + 1, sum + Lu[i]))return true;return false;}int main(){scanf("%d %d", &n, &k);for (int i = 1; i <= n; i++){scanf("%d", &Lu[i]);}int sum = 0;if (dfs(1, 0))printf("Yes\n");elseprintf("No\n");return 0;}