DFS hdu2266（How Many Equations Can You Find）

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
   
   

题解：dfs

#include<cstdio>
#include<cstring>
using namespace std;
	char s[15];
	long long n,num,len;
void dfs(long long ans,long long sum){
	if (ans==len){
		if (sum==n)
		num++;
		return ;
	}
	long long k=0;
	for (int i=ans;i<len;i++){
		k=k*10+s[i]-'0';
		dfs(i+1,sum+k);
		if (ans!=0)//第一个数前面不能有‘-’
		dfs(i+1,sum-k);
	}
	
} 
int main(){

	while (scanf ("%s %lld",s,&n)!=EOF){
		num=0;
		len=strlen(s);
		dfs(0,0);
		printf ("%lld\n",num);
	}
	
	return 0;
}