How Many Equations Can You Find
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 908 Accepted Submission(s): 604
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 <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
char s[30];
long long n,ans;
int len;
void dfs(long long sum,long long sum1,int pos,int op)
{
if(pos==len )
{
if(n==sum+sum1*op)
ans++;
return ;
}
dfs(sum,sum1*10+s[pos]-'0',pos+1,op);//之间不加符号,保留原符号
dfs(sum+sum1*op,s[pos]-'0',pos+1,1);//下一个数前加一个 加号
dfs(sum+sum1*op,s[pos]-'0',pos+1,-1);//下一个数前加一个 减号
}
int main()
{
while(~scanf("%s %lld",s,&n))
{
len=strlen(s);
ans=0;
dfs(0,s[0]-'0',1,1);
printf("%lld\n",ans);
}
return 0;
}