N(3<=N<=9),且每层只有三个状态,裸的dfs,不加任何剪枝和优化也时秒杀
用sum记录当前加和,用last记录当前的连续数,就是之前添' '连成的数。
/*
ID: xsy97051
LANG: C++
TASK: zerosum
*/
#include <cstdio>
#include <iostream>
using namespace std;
char ans[18];
int n;
void dfs(int k, int sum, int last)
{
if (k == n)
{
if(sum+last == 0) puts(ans);
return;
}
ans[k*2-1] = ' ';
dfs(k+1, sum, last > 0 ? last*10+k+1 : last*10-k-1);
ans[k*2-1] = '+';
dfs(k+1, sum+last, k+1);
ans[k*2-1] = '-';
dfs(k+1, sum+last, -k-1);
}
int main()
{
freopen("zerosum.in", "r", stdin);
freopen("zerosum.out", "w", stdout);
cin>>n;
for(int i=0;i<n;++i)
ans[i*2]=i+'1';
dfs(1, 0, 1);
return 0;
}