CT23213

Gail's verses Bracket Repair

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

Legend says the vault under the ivy courts of Vineward opens only for a perfect tally of verses. Gail means to find out. Task: Print the minimum number of parentheses (either kind) that must be inserted to make the sequence balanced. Input format: One line with a string of parentheses. Output format: Print the minimum insertion count. Constraints: 1 <= |s| <= 1135; characters are '(' and ')'.

Example 1:

Input: ()(((())()(((((((()()()))()()))(())))))))((())()(((())())(()()())))))())(((((()()(((())((((((())()()))()))()())))))(())((()(())(((((((()())())(())(()()((((())((()())))()()))()())))()))(((((()))(((()))(())(((()()))))))((()(()))(())()((())))))((((()())(())))())())()(()())()))))()(((((())))((()))()))()((()))))((())))((()(())()()))))()))()())))()()))))()))))(()()()((()((((()(()(()())()())()(())))())()(((()))((()(()(()((()())))))))())(())()((())))))()))(()())()((()))()((()(((()(((())))()()))((())((((()))()()(()(()))))())()((()())))()((()(()((())))(()))())(()(())()))(()()(()())())(()))(())))()()))()(())(((()()()(((()((()(()))(()))((((())())()(((()(())()((((())())))())()()((())()(()())()())()))())()()))()()()())((())())((((())(((((()))(()(())))(()())))())((()())()(()((())()()())(((()(())()(()))()…
Output: 35

Example 2:

Input: ()))())((()(()())(()((((()))(()(())))))))()())()((())))))())(()()))())((()((()()()))())))((())))())))()())))()()()(((())())))()())))((())())((())((()(())())()(((()()(()))))))()(()((((()(()())((())(((())(()))()()())((()(())()()((()))()()((()))))())((((()()((()))))(())()(()))()(()()()())))(())())(()))()(((()())))((()(()())(()((()(((()(()(((()()(())()))(())())()(())(()())(())()()(()()))()()(()))(((((()))((())(())(((())))()()((((()()((((((()(())))((())()()))(())))))))()()(()())(()())((((())(((()(()()()))())())()))(()))(((()))(()(()))))))())(()))())((()())(()))()((()())))))(((()(()))))())))())((()((())(())))(()(()())()()(()))())(((((()((((((())(((())))((((((((()))(((())()()()))(())))(((())(((()(())))(((()))()((()))))((())))((()(())())((()()))(())(())((()())()(()(())
Output: 41

Example 3:

Input: (())()))((((((())))((((()())))((()((()()(((()())()))))))()()(()(((())()(())()((((()((()((())((()()))(()()(())((())())(())(())(()()((()()()()(()(()(())()(()))(()(()()((()))))(((())()())(()))()))(((()((()()((()()(())(((())()())))(((()()))()()(()()))()(())()())(())()()())))()(((()(()(()(((()())()((((()))()()))()))())((()())())()())((()()))(()())))))())((()(()))))))(((()))()()())))((()())(()(((()()(()())(()))())))))(()))(()()))))()()))((())(())((((())))(())()(((((((()(()())()))))(()((((()((()(()()(())((())(((()())()())())(())(()((((()())))()(())()))()((()((((())((()())()())(())()()()()()((()))))((()()())()()((())(((())())(((())(()(()((()(()))))(())))(())()()((((()(()))))((())()((((((())()()))()())()()(()()()()(()))))())))())(((()(()()))))))(())(()))))))(()()))((()(()()))(())()))((()()()(((((()…
Output: 49

Constraints:

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

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