现有一个数为N，通过在123456789中间加入+-号，是否能拼出这个数N，如果能输出运算表达式以及种数num，如果不能输出0

#include
#include
using namespace std;

int ops[21];
const char sym[3] = {’+’ , ‘-’ , ’ '};
int result , num;

void dfs(int layer, int currentResult, int lastOp, int lastSum)
{
lastSum *= (layer > 9) ? 100 : 10;
lastSum += layer;
if(layer == 9)
{
currentResult += (lastOp) ? (-1 * lastSum) : lastSum;
if(currentResult == result)
{
++num;
printf(“1”);
for(int i = 2 ; i <= 9 ; ++i)
{
if(sym[ops[i-1]] != ’ ')
printf(" %c “, sym[ops[i-1]]);
printf(”%d", i);
}
printf(" = %d\n" , result);
}
return;
}
ops[layer] = 2;
dfs(layer + 1 , currentResult , lastOp , lastSum); //Continue
currentResult += (lastOp)? (-1 * lastSum) : lastSum;
ops[layer] = 0;
dfs(layer + 1 , currentResult , 0 , 0); //Plus
ops[layer] = 1;
dfs(layer + 1 , currentResult , 1 , 0); //Minus
}

int main()
{
while(scanf("%d", &result) != EOF)
{
num = 0;
dfs(1 , 0 , 0 , 0);
printf("%d\n" , num);
}
return 0;
}
eg:N为20 共有15种方法