#include<stdio.h>
#include<string.h>
const int maxn=130;
char A[maxn],s[maxn];
int top;
int main()
{
#ifndef ONLINE_JUDGE
freopen("673.txt","r",stdin);
#endif
int n;
scanf("%d\n",&n);
while(n--)
{
top=0;
fgets(s,sizeof(s),stdin);
int len=strlen(s);
int ok=1;
for(int i=0;i<len-1;i++)
{
//if(s[i]=='\n') continue;
if(s[i]=='(' || s[i]=='[') A[++top]=s[i];
else if(s[i]==')' && A[top]=='(' ||
s[i]==']' && A[top]=='[')
top--;
else
{
ok=0;
break;
}
}
if(ok && !top) printf("Yes\n");
else printf("No\n");
}
return 0;
}
uva 673 - Parentheses Balance
最新推荐文章于 2024-02-11 21:51:50 发布