问题描述:
部分和问题
给定n个整数,从中取出若干个数,使它们的和恰好为k;
input:n,k,arr[100]
很简单直接上代码
#include<iostream>
#include<cstdio>
using namespace std;
const int MAX = 100;
int n, arr[MAX], k;
void solve();
int DFS(int i, int sum);
int main(){
cin >> n;
for(int j = 0; j < n; j++)
cin >> arr[j];
cin >> k;
solve();
return 0;
}
int dfs(int i, int sum){
if(sum == k) return 1;
if(sum > k) return 0;
if(i == n) return sum == k;
if(dfs(i + 1, sum)) return 1;//不加arr[i]
if(dfs(i + 1, sum + arr[i])) return 1;//加上arr[i]
return 0;
}
void solve(){
if(dfs(0, 0)) cout << "Yes" << endl;
else cout << "No" << endl;
}