673 - Parentheses Balance

You are given a string consisting of parentheses () and []. A string of this type is said to be correct:

(a)

if it is the empty string

(b)

if A and B are correct, AB is correct,

(c)

if A is correct,  (A ) and  [A ] is correct.

Write a program that takes a sequence of strings of this type and check their correctness. Your program can assume that the maximum string length is 128.

Input 

The file contains a positive integer  n  and a sequence of  n  strings of parentheses  ()  and  [] , one string a line.

Output 

A sequence of  Yes  or  No  on the output file.

Sample Input 

3
([])
(([()])))
([()[]()])()

Sample Output 

Yes
No
Yes

#include<iostream>
#include<cstdio>
#include<stack>
using namespace std;

int main()
{
	int n,flag;
	char c;
	cin>>n;
	getchar();
	for(int i=0;i<n;i++)
	{
		flag=1;
		stack<char> str;
		while((c=getchar())!='\n')
		{
			if(flag==0) continue;
			if(c=='(' || c=='[')
				str.push(c);
			if(c==')')
			{
				if(str.empty())
				{
					flag=0;
					continue;
				}
				if(str.top()!='(')
				{
					flag=0;
					continue;
				}
				str.pop();
			}
			if(c==']')
			{
				if(str.empty())
				{
					flag=0;
					continue;
				}
				if(str.top()!='[')
				{
					flag=0;
					continue;
				}
				str.pop();
			}
		}
		if(!str.empty()) flag=0;
		if(flag==1) cout<<"Yes"<<endl;
		else cout<<"No"<<endl;
	}
	return 0;
}