部分和问题-dfs穷举

#include <iostream>
using namespace std;
const int maxn=10005;
int a[maxn];
int n;
int sum;
bool dfs(int i,int cursum){
if(i==n){
return cursum==sum;
}
if(dfs(i+1,cursum+i)) return true;
if(dfs(i+1,cursum)) return true;
return false;
}
int main(int argc, char const *argv[])
{
while(cin>>n){
for(int i=1;i<=n;i++){
cin>>a[i];
}
cin>>sum;
dfs(0,0);
}
/* code */
return 0;
}