How Many Equations Can You Find

最新推荐文章于 2023-12-22 02:23:09 发布

yuebaba

最新推荐文章于 2023-12-22 02:23:09 发布

阅读量115

点赞数

分类专栏： DFS

本文链接：https://blog.csdn.net/yuebaba/article/details/81347391

版权

DFS 专栏收录该内容

6 篇文章 1 订阅

订阅专栏

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

#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
int vis[105],ans;
int n,len;
char str[205];
void DFS(int sum,int id){
    if(sum==n&&len==id)
    {
    	ans++;
    	return ;
	}
	long long temp=0;
	for(int i=id;i<len;i++)
	{
		temp=temp*10+str[i]-'0';
		DFS(sum+temp,i+1);
		if(id!=0)
		DFS(sum-temp,i+1);
	}
}
int main() 
{
	while(cin>>str>>n)
	{
		ans=0;
		memset(vis,0,sizeof(vis));
		len=strlen(str);
		DFS(0,0);
		cout<<ans<<endl;
	}
	return 0;
}