杭电2266 How Many Equations Can You Find

最新推荐文章于 2019-03-31 23:41:40 发布

idealistic

最新推荐文章于 2019-03-31 23:41:40 发布

阅读量237

点赞数

分类专栏：杭电acm~bestcoder 编程语言 ==数学and思维== DFS（深度搜索） ----------字符串----------

本文链接：https://blog.csdn.net/idealistic/article/details/52748754

版权

编程语言同时被 3 个专栏收录

307 篇文章 0 订阅

订阅专栏

==数学and思维==

131 篇文章 0 订阅

订阅专栏

杭电acm~bestcoder

111 篇文章 1 订阅

订阅专栏

How Many Equations Can You Find

Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u

Submit Status

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

深搜，计算每种可能情况的值

     
     
      
      
       
       1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41

       
       #include<iostream>
#include<string>
#include<algorithm>
using namespace std;
string s;
long n;
int cot;//方案数
long shu(int c,int e)//计算数值 
{
long sum=0;
	for(;c<=e;c++)
	sum=sum*10+s[c]-'0';
	return sum;
 }
 void dfs(int result,int c)//c表示字符位置 
 {
 	if(c>=s.length())//计算到字符串末尾 
 	{
 		if(result==n)
 		cot++;
	 }
	 else
	 {
	 for(int i=c;i<s.length();i++)
	 {
	 	dfs(result+shu(c,i),i+1);
	 	if(c!=0)//第一位前不能加- 
	 	dfs(result-shu(c,i),i+1);
		 }	
	 }
  }
  int main()
 {
 	while(cin>>s>>n)
 	{
 		cot=0;
 		dfs(0,0);
 		cout<<cot<<endl;
	 }
	 return 0;
  }