#include
#include
#include
using namespace std;
int a[10]={5,9,-6,14,56,43,-23,9,4,8};
int ans[1000000];
int k=6;
int x=93;
int n=10;
void dfs(int now,int snum,int s)
{
if(x==s&&snum==k)
{
for(int i=0;i
printf("%d ",ans[i]);
putchar('\n');
return;
}
if(now>=n)
return;
ans[snum]=a[now];
dfs(now+1,snum+1,s+a[now]);
dfs(now+1,snum,s);
}
int main()
{dfs(0,0,0);
return 0;
}
#include
#include
using namespace std;
int a[10]={5,9,-6,14,56,43,-23,9,4,8};
int ans[1000000];
int k=6;
int x=93;
int n=10;
void dfs(int now,int snum,int s)
{
if(x==s&&snum==k)
{
for(int i=0;i
printf("%d ",ans[i]);
putchar('\n');
return;
}
if(now>=n)
return;
ans[snum]=a[now];
dfs(now+1,snum+1,s+a[now]);
dfs(now+1,snum,s);
}
int main()
{dfs(0,0,0);
return 0;
}