CT28824

The charms Bracket Repair Puzzle

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

Every season at the mushroom groves of Fungaldeep, someone must inspect the delivered goods. This year the task falls to Lila, armed only with the charms register. 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| <= 1953; characters are '(' and ')'.

Example 1:

Input: (()((((())(())((())((((()(()((((()()())()((()(((())((()()()()()())))())(((())((())()))(())())())())((()))())(()(()))(())()(()))()()()())))(()((()(()))(((()()))((()())())(())())(()()()(())))()()))(())))()(()()())))(()(()())((()))))(((()))()((()()(()))()()()((()))((()(()()(()(()))())(((())())())))())()()()()(()))((()())(((()()))())()())())))(()((((())()
Output: 5

Example 2:

Input: )(()))()))(()(()))))))(((()))))()((())()()((()())())(((((()))((()()()((()((()())((())()())))))(()(()))(((()(((())))())))(((()((((((())((()()())()))())((())((()(((((((((((()))))())(()))))()(((()(((())))())))(()((()))(((((()))()))(())(())))))))(())())((()))()()(()(())()))))()(())))((())(()))())((())((((()((()()())))())()())(()))()((()()(()(((())((((())()(()))())))))))((()())()(()(()()))())((())())))))()(())()())()(((((())((()()())))(())))))(()))(())((((())))))(((((((((()))())()()(()())(()(()(()())))())())(()(())()(()())())(()))(()())(()()))((()))(()(())))))((()((()))(())(())()())))()())()()))))))()((())()((()())(()))(())()))(()))))))((()()(()))(()((()())))((())(()(()(((())(()()()))()(()()))(())(())())()(((()))(((())()((()())()((()))())(()()()))))))()(())(()(()))()((()))(())(()(()())()))((((()()(()(()())))()((()))((()))(()(()))((((()(()())))()((()((())((()(()))()()(()())((())(((())))())))()()((()()())))((())))())(()((()()))(((((()((()))()(((()))))())))()(())))()((()(((()((())())()))))()())()))((())))())(()()())))))())())(((()())())(((((((())(((())))()))))()))))())())(()))()()((()))()(())(()))(((()(()()((())((((())))))))()()()()))()((()()))())())()(())((()())())())))(((()))()))((()(()((()()()((()(()(()))()(())))))))))(()))))())((()())()((()()((())()((())))(()))(()())(((()(((()()()(()(()(((()()((()()(())(((()(())())(()()(((())))((()()))(((()))(()())))(()((()(((((()()((((())())))())()))(((())(())))())()(())((()))))()(()((((((()(())(()))())()()((())))()))())((()()((()((()(()((())()()((())))))()()
Output: 72

Example 3:

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

Constraints:

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

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