算法-程序设计课week3---A - 选数问题

A - 选数问题

Given n positive numbers, ZJM can select exactly K of them that sums to S. Now ZJM wonders how many ways to get it!

Input

The first line, an integer T<=100, indicates the number of test cases. For each case, there are two lines. The first line, three integers indicate n, K and S. The second line, n integers indicate the positive numbers.

Output

For each case, an integer indicate the answer in a independent line.

Example
Input

1
10 3 10
1 2 3 4 5 6 7 8 9 10

Output

4

Note

Remember that k<=n<=16 and all numbers can be stored in 32-bit integer

思路与收获
这道题最简单就是穷举遍历，穷举每种出现的情况并计算哪些情况符合要求。本题中我们使用深搜进行遍历。

另外本题貌似可以用动态规划？可以我想不出来怎么做，动态规划是我一生之敌orz。

#include <cstdio>
using namespace std;

void  dfs(int& answer,int* a,int* v,int sum,int k,int n,int s,int pos,int deepth) {
	//失败的返回条件
	if(deepth>k||s>sum)return;
	//成功的返回条件
	if(deepth==k&&s==sum)answer++;
	//遍历，顺序无关
	for(int i=pos; i<n; i++) {
		if(!v[i]) {
			v[i]=true;
			dfs(answer,a,v,sum,k,n,s+a[i],i+1,deepth+1);
			v[i]=false;
		}
	}
}

int main() {
	//freopen("in.txt","r",stdin);
	int t;
	scanf("%d",&t);

	while(t--) {
		int n,k,sum;
		int answer;
		scanf("%d %d %d",&n,&k,&sum);
		int a[n]={0};
		int v[n]={0};
		answer=0;
		for(int i=0; i<n; i++)scanf("%d",&a[i]);//获取数组内容
		dfs(answer,a,v,sum,k,n,0,0,0);//进行遍历
		printf("%d\n",answer);
	}
	return 0;
}