HDOJ 题目2266 How Many Equations Can You Find（DFS水）

How Many Equations Can You Find

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

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

lcy   |   We have carefully selected several similar problems for you:   2272  2268  2265  2267  2270 

 题目大意：给个字符串，给个n，字符串之间通过加+或-，使结果等于后边那个数

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
#define LL long long
using namespace std;
char str[20];
LL a;
int len,sum;
void dfs(int pos,LL val)
{
    int i;
    if(pos==len)
    {
        if(val==a)
            sum++;
        return;
    }
    LL temp=0;
    for(i=pos;i<len;i++)
    {

        temp=temp*10+str[i]-'0';
        dfs(i+1,val+temp);
        if(pos!=0)
            dfs(i+1,val-temp);
    }
}
int main()
{
    while(scanf("%s%lld",str,&a)!=EOF)
    {
        len=strlen(str);
        sum=0;
        dfs(0,0);
        printf("%d\n",sum);
    }
}