Nyoj 2 bracket matching (basic use of stack)

Nyoj 2 bracket matching (basic use of stack)
Bracket matching problem time limit: 3000 MS | memory limit: 65535 KB difficulty: 3

Description

Now, there is a sequence of parentheses. Please check whether this line of parentheses is paired.

Input

Input a number N (0 Output

The output of each group of input data occupies one row. If the brackets contained in the string are paired, Yes is output. If the string is not paired, No is output.

Sample Input

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

Sample output

NoNoYes

Source

Network

Uploaded

The naonao code is as follows:

#include
     
      #include
      
       char a[10010];int main(){int n;scanf("%d",&n);while(n--){int i,len,top=0;scanf("%s",a);len=strlen(a);for(i=1;i