DFS HDU 2266

How Many Equations Can You Find

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 582    Accepted Submission(s): 378

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
  
  

 

Author

dandelion

 

Source

HDU 8th Programming Contest Online

 

Recommend

#include <stdio.h>
#include <stdlib.h>
#include <malloc.h>
#include <limits.h>
#include <ctype.h>
#include <string.h>
#include <string>
#include <math.h>
#include <algorithm>
#include <iostream>
#include <stack>
#include <deque>
#include <vector>
#include <set>
#include <map>
using namespace std;
typedef __int64 ll;
#define MAXN 15
char s[MAXN];
ll n;
int len;
int ans;

void DFS(int pos,int sum){
    if(pos==len && sum==n){
        ans++;
        return ;
    }
    ll tmp=0;
    int i;
    for(i=pos;i<len;i++){
        //tmp = tmp*10+(s[i]-'0');
        tmp=tmp*(ll)10+s[i]-'0';
        DFS(i+1,tmp+sum);
        if(pos!=0){
            DFS(i+1,sum-tmp);
        }
    }
}

int main(){
    int i;

    while(~scanf("%s",s)){
        scanf("%I64d",&n);
        len = strlen(s);
        ans = 0;
        DFS(0,0);
        cout<<ans<<endl;
    }

    return 0;
}