UVA——673 Parentheses Balance

題目：

         Parentheses Balance

Problem Description

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

(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
           

題目描述：

         括号比對問題，用棧來寫的，比較坑的是，當讀入空行時要判為Yes。當時我用的scanf,然後就用%c讀的，再手動把換行符換成\0。

解題代碼：