How Many Equations Can You Find

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

#include<stdio.h>
#include<string.h>
char s[15];
__int64 n;
int cnt,len;
void dfs(int st,__int64 sum,int flag)
{
	if(st==len-1)
	{
		if(sum==n)  cnt++;
		return;
	}
	__int64 num=0;
	int i;
	for(i=st+1;i<len;i++)
	{
		num=num*10+s[i]-'0';
			dfs(i,sum+num,flag+1);
		if(flag)	dfs(i,sum-num,flag+1);
	}
}
int main()
{
	//freopen("b.txt","r",stdin);
	while(scanf("%s",s)!=EOF)
	{
		scanf("%I64d",&n);
		len=strlen(s);
		cnt=0;
		dfs(-1,0,0);
		printf("%d\n",cnt);
	}
	return 0;
}