DFS--深搜—n个数中k个数的和为sum

#include<iostream>
#include<math.h>
#include<cmath>
using namespace std;
int nums[5] = {1,3,5,8,11};
int i = 0, s = 0, cnt = 0;
void dfs(int i,int cnt,int s) {
	if (i > 5) {
		return;
	}
	if (cnt==2 && s == 16) {
		cout << "yes" << endl;
		return;
	}

	dfs( i+1,cnt+1 ,s + nums[i]);//选择了第i个数
	dfs( i+1, cnt,s );
	
}

int main() {

	dfs(0,0, 0);

	return 0;
 }