POJ 1145 Tree Summing G++ dfs未实现

#include <iostream>
#include <cstdio>
#include <string>
#include <stack>
#include <map>
using namespace std;
//抄博友程序       dfs未实现 
int main()
{
	int x;
	while(1)
	{
		cin>>x;
		if(cin.eof()==1)
		{
			break;
		}
		string a="";
		int js=0;
		while(1)
		{
			string b;
			cin>>b;
			for(int i=0;i<b.size();i++)
			{
				if(b[i]=='(')
				{
					js++;
				}else if(b[i]==')')
				{
					js--;
				}
			}
			for(int i=b.size()-1;i>=0;i--)
			{
				if(b[i]=='('|| b[i]==')'|| b[i]>='0' || b[i]<='9' || b[i]=='-')
				{
					
				}else
				{
					b.erase(i,1);
				}
			}
			a=a+b;
			if(js==0)
			{
				break;
			}
		}
		//cout<<a<<endl;
		if(a=="()")
		{
			if(x==0)
			{
				cout<<"yes"<<endl;
			}else
			{
				cout<<"no"<<endl;
			}
			continue;
		}
		stack<int> sta;
		while(sta.empty()!=1)
		{
			sta.pop();
		}
		map<int,int> mp;
		mp.clear();
		int sum=0;
		for(int i=0;i<a.size();i++)
		{
			if(a[i]=='(')
			{
				int he=0;
				if(a[i+1]>='0' && a[i+1]<='9')
				{
					i++;
					while(a[i]>='0' && a[i]<='9')
					{
						he=he*10+a[i]-'0';
						i++;
					}
					i--;
					sum=sum+he;				
				}else if(a[i+1]=='-')
				{
					i++;
					i++;
					while(a[i]>='0' && a[i]<='9')
					{
						he=he*10+a[i]-'0';
						i++;
					}
					i--;
					he=-he;
					sum=sum+he;					
				} 
				sta.push(he);
			}
			else if(a[i]==')')
			{
				if(a[i-1]=='(')
				{
					if((i+2)<=(a.size()-1) && (a[i+1]=='(') && a[i+2]==')')
					{
						mp[sum]=1;
						i++;
						i++; 
						//cout<<sum<<endl;						
					}
				}
				int t=sta.top();
				sta.pop();
				sum=sum-t;	
			}
		}
		if(mp[x]==1)
		{
			cout<<"yes"<<endl;
		}else
		{
			cout<<"no"<<endl;
		}
	}	
}