]]>
#include <stdio.h>#include <memory.h>const int MAXN = 1001 ;int g_Sum , g_NumArr[MAXN] ; //璁板綍鎵鏈夎妭鐐圭殑鏉冨?/span>bool OK , g_visible[MAXN] ; //璁板綍鍝簺鏄彾緇撶偣void ReExp( int &nPos, int sum )
{
if ( OK ) return ; //鎵懼埌鍒欒繑鍥?/span> int num = g_NumArr[nPos] + sum ; if ( !g_visible[nPos + 1] && !g_visible[nPos + 2] )
{ if ( g_Sum == num ) OK = true ; nPos += 2 ; return ;
} nPos++ ; if ( g_visible[nPos] ) { ReExp( nPos, num ) ; } nPos++ ; if ( g_visible[nPos] ) { ReExp( nPos, num ) ; } 
}void Init(){ OK = false; memset( g_visible, 0, sizeof(g_visible)) ; memset( g_NumArr, 0, sizeof(g_NumArr)) ;}int main(){// freopen("in.txt", "r", stdin); char cmd ; int flag, mark, num, m ; bool aNum ; while ( scanf("%d", &g_Sum) != EOF ) { Init() ; flag = 1; while ( (cmd = getchar()) != '(' ) ; mark = 1; m = num = 0; aNum = false ; //澶勭悊杈撳叆鏁版嵁錛屾敞鎰忔湁璐熸暟 while ( mark != 0 ) { cmd = getchar() ; switch(cmd) { case '(': mark++; if ( aNum ) g_visible[m] = true ; aNum = false ; g_NumArr[m++] = num * flag; num = 0; flag = 1 ; break; case ')': mark--; break; case '-': flag = -1; break; case ' ': case '\0': case '\n': break; default: num = num * 10 + (cmd - '0'); aNum = true ; } } int pos = 0 ; ReExp( pos, 0 ) ; if ( OK ){ printf("yes\n"); } else { printf("no\n"); } } return 0 ;}
]]>