HDU - 2266How Many Equations Can You Find dfs

Description

Now give you an string which only contains 0, 1 ,2 ,3 ,4 ,5 ,6 ,7 ,8 ,9.You are asked to add the sign ‘+’ or ’-’ between the characters. Just like give you a string “12345”, you can work out a string “123+4-5”. Now give you an integer N, please tell me how many ways can you find to make the result of the string equal to N .You can only choose at most one sign between two adjacent characters.

Input

Each case contains a string s and a number N . You may be sure the length of the string will not exceed 12 and the absolute value of N will not exceed 999999999999.

Output

The output contains one line for each data set : the number of ways you can find to make the equation.

Sample Input

123456789 3
21 1

Sample Output

18
1

Hint

题意

题解：

AC代码

#include<cstdio>
#include<cstring>
#include<stack>
#include <set>
#include <queue>
#include <vector>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long LL;
const int N  = 1e2+100;
char st[20];
LL n,len,num;
void dfs(LL l,LL ans){
        if (l == len){
            if (ans == n){
                num++;
            }
            return ;
        }
        LL k = 0;
        for (LL i = l; i < len; ++i){
            k = k*10+st[i]-'0';
            dfs(i+1,ans+k);
            if (l!=0) dfs(i+1,ans-k); //从0开始的时候不能减
        }
}
int main()
{
    while (scanf("%s%lld",st,&n)!=EOF){
        len = strlen(st);
        num = 0;
        dfs(0,0);
        printf("%d\n",num);
    }
    return 0;
}