Link:https://vjudge.net/contest/174968#problem/E
题目:
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
Code:
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<stack>
#include<queue>
using namespace std;
long long n,num,l;
char s[20];
void DFS(int x,int sum)
{
if(x==l)
{
if(sum==n)
num++;
return;
}
long long k=0;
for(int i=x;i<l;i++)
{
k=k*10+s[i]-'0';
DFS(i+1,sum+k);
if(x!=0) //第一个数字前不能加'-'号
DFS(i+1,sum-k);
}
}
int main()
{
while(~scanf("%s%lld",s,&n))
{
l=strlen(s);
num=0;
DFS(0,0);
printf("%lld\n",num);
}
return 0;
}