括號匹配進階版
//============================================================================
// Name : Nesting a Bunch of Brackets.cpp
// Date : 2013/4/9 上午12:23:30
// Author : GCA
//============================================================================
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
using namespace std;
#ifdef ONLINE\_JUDGE
#define ll "%lld"
#else
#define ll "%I64d"
#endif
typedef unsigned int uint;
typedef long long int Int;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\\n")
#define I\_de(x,n)for(int i=0;i<n;i++)printf("%d ",x\[i\]);Pln()
#define De(x)printf(#x"%d\\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\\
printf("%d ",dp\[htx\]\[hty\]);}Pln();}
#define M 55
#define PII pair<int,int\>
#define PB push\_back
#define oo INT\_MAX
#define Set\_oo 0x3f
#define Is\_debug true
#define debug(...) if(Is\_debug)printf("DEBUG: "),printf(\_\_VA\_ARGS\_\_)
#define FOR(it,c) for(\_\_typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
int tmp=min(x,y);
return min(tmp,z);
}
int max3(int x,int y,int z){
int tmp=max(x,y);
return max(tmp,z);
}
bool isleft(char c){
return ((c=='(')||(c=='\[')||(c=='{')||(c=='<'));
}
bool isright(char c){
return ((c==')')||(c=='\]')||(c=='}')||(c=='>'));
}
int main() {
ios\_base::sync\_with\_stdio(0);
char str\[10000\];
while(~scanf("%s",str)){
stack<char\> s;
// str\[strlen(str)\]='@';
int len=strlen(str);
int cnt=1;
int i;
for(i=0;i<len;i++,cnt++){
if(isleft(str\[i\])){
if((str\[i\]=='('&&str\[i+1\]=='\*')){
s.push('\*');
i++;
}else{
s.push(str\[i\]);
}
}else if(isright(str\[i\])||(str\[i\]=='\*'&&str\[i+1\]==')')){
if(s.empty()){
break;
}
char tmp=s.top();
if(str\[i\]=='\*'){
if(tmp!='\*')break;
s.pop();
i++;
}else if(str\[i\]==')'){
if(tmp!='(')break;
s.pop();
}else if(str\[i\]=='\]'){
if(tmp!='\[')break;
s.pop();
}else if(str\[i\]=='}'){
if(tmp!='{')break;
s.pop();
}else if(str\[i\]=='>'){
if(tmp!='<')break;
s.pop();
}
}
}
if(!s.empty()||i<len){
printf("NO %d\\n",cnt);
}else printf("YES\\n");
}
}