【HDU 2266 How Many Equations Can You Find】+ DFS

How Many Equations Can You Find

Problem 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

题意 ： 可以在给出的字符里任意加 “-”或“+”,最后得到的数 = N的方案数DFS直接搜索即可；

AC代码：

#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
const int MAX = 1e5 + 10;
typedef long long LL;
LL n;
int cut,nl;
char s[13];
void dfs(int l,LL sum){
    if(l == nl && sum == n){
        cut++;
        return ;
    }
    LL ans = 0;
    for(int i = l; i < nl; i++){
        ans = ans * 10 + (s[i] - '0');
        dfs(i + 1,sum + ans);
        if(l)
            dfs(i + 1,sum - ans);
    }
}
int main()
{
    while(~scanf("%s %lld",s,&n)){
        cut = 0,nl = strlen(s);
        dfs(0,0);
        printf("%d\n",cut);
    }
    return 0;
}