CT27415

Last sigils of Corwin

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

Corwin runs the observatory at the lily shoals of Padmore. Today the books show a list of sigils, and the numbers must be worked out before sundown. Task: A string contains only '(' and ')'. Print YES if it is a balanced bracket sequence, otherwise NO. Input format: One line with a string of parentheses. Output format: Print YES or NO. Constraints: 1 <= |s| <= 1198; characters are '(' and ')'.

Example 1:

Input: )())())((())))(((()(()()()(()())()())))((((((((()())(()())())))(((())((())))()()(()())()())))))))())()(()(()(())()))))())(())))((((())))()(()))())))())((((())((((()(())))))()()()((()()((((()))))))))()))())((()()(()(()(()())))())()(((()((
Output: NO

Example 2:

Input: )())(())()(())))((()((()()(())()(((())()(()(()()((()()(()()))())(()((())()))()()()()()())))))(())))(())))(())())(((())())()(((()))))(())))(((()())(((()((())()((((()(()()))(((())(((())((())))(()))((())((()(()()())())))()()()(()(()()(((()))(()(((()(()((()()((())()((((()(())(())))())))((()(()((((()))()(()((())())))))(())(()()(()(()(())()()()))())))))((()))((()((((()))))()((()((()(((())(()()())((())()()())(())(()))))))(())((())()()((()())((())(()(()()))()())()))(()))(((())()((()()))()())((()()))((())(
Output: NO

Example 3:

Input: (()(())((())))))())))(()))()()())))())(()))((()((((())))((())((()()()()()))((()(()))))()(()((((()()))(()())()))()))())()()((()())()))))()()))((()(()()))()()()()()((()))()((())()())()))(()((())(()()((((()(((((((()())((())()))()(()()))))(()(())()))()(()))()(()(()((())()())(()()((()())))(()))()))()))(())))((((()))(()(()))))(((()(())))()()((((())(()((((((())(()(())()(()())(()))()((()())(()(((()(()()))(()()))()))())()()(()((())())((()((()()())((()(()())(())())())(())()())()()())()((()()()(((((()(()))()((()())(()()())))()))(()())()((()()()())((())()))(())()(()))))())()())))())()(()(()
Output: NO

Constraints:

1 <= |s| <= 1198; characters are '(' and ')'.

Loading...
Test Cases:No test cases
No test cases available.