CT27874

The Chessfield Bracket Repair

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

The clerk Chaplain has been asked to assign crews to the morning shifts. On the desk lies a long table of verses readings. 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| <= 1015; characters are '(' and ')'.

Example 1:

Input: ()(((())((()()))())((()(()()())))())(()()(((()()(((((())))((())(()))))))(((()(())()()(()(()()(()()(()())))))()()(())())(())()((((()()(()))()(()(((((())()()())()(((()()()()))(()))(()(((())(((()()(((()(())(()))(()(()((()))(()(()())()))()((()(())(())((())())((())))())()(()())(()(()(((((()())))(())())))())((((()((()))())()())())(())(()(()((())((()))()()()()(()()(()(())))))))())()((()))(())(())(()))()))()(()((())((())()())))()()()(((((())())((((((()(())()))))(()((())()()(()()(())()()))))())))))))(()))()()))()()))))()))((()((((()(()((((((()())())))()()(())(()()()((()))((()()(()))))))())))))()))(()((((()))()(())()((((()((()(()(()(()))((()))(())((()((()(()()()(()))())()))(())))())(()()()(()))()())(()
Output: 11

Example 2:

Input: ()))))(())()(()(()(()()))))()()((()()))(())((()((((()))((())()(((())()))()()(((()()()()(((()(((()))))))((((())(())(()(((()((((())))()(()()()(())))))(()()(()()((((((()(((((()))))(()))(((())(())()))))))(()))())))())()()()((()))(((()))()())(((())()))(((()()))))()(((()())(((((((()))))))()))(()()))))))))))())))(()((())(()((()(((()())(()(()))(((((((((()))()(())))))))))()())()))(((())()()()())))((())(()())))))(()))()(())(()()())))()()(()())())(()))))()()()()())())))(())())(((())))((()())(((()()(()))))))))((()(()))((((
Output: 26

Example 3:

Input: ))(()()(()(())))((()))))()(())()((()())))())()()()()())())(((())(()))((()))((()()(((()()))))()(())(())()()(())()(()))()(((((())))()()((((())(())()())((((())())))()))()()))((()())()))(()(((((()((())()())(()))()))())()(((()(()()))))()(())((()(((()))))))())))()()(())))()()())(((((((())()(((())())((()())((()))(()())()))))(()()))(()))()))())((())()()()))(((())(()())))))))(((())(((()())(()(()(())))((()()))(((((()(()(()()))())))()))))()()))(()))((((((())((())))))())(()(((()(())())((()()))(())(()))())))))))))(())())(()))))((()())()(()())))(()))((()(()()(()))()())())(()()((()()()()()((()()))(())()))()))(((()())()()())())()()))))))())((()(())()()())()))))(((())(())()()((((((()())))(((())))))(()(()((())()(()()((())(()))))()((((((()(())(())))()()))()((()())(())()(()(()))))(()))))(()())((())))((())()))()))))))))()(()())((()(())))(()())((()))())())()())(())())()(()())()())())((((((((()((((())((()(((((()))))()()())))(()((())()))((()))
Output: 67

Constraints:

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

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