CT28158

Yusuf's Jasper sigils

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

Yusuf runs the brewery at the observatory of Starfall. Today the books show a list of sigils, and the numbers must be worked out before sundown. 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| <= 1173; characters are '(' and ')'.

Example 1:

Input: ()((())(((()((()(((()()()((()(((())()))))()((()((()()))()()()()()))())((()))))())()((())())())(((()))))())((())()(())(()))()(()))()(())(())(()))(()))))(()))()()(())()((()(((())(()((()))(()))(((()()()))(())()(()()))(()(()(()())()(()(()))((()()((())())()()(((())())(()((((())))))((()((()))()(()((()(((()))()(((()(())()((()(((())))(()()(())(((((())((()(())((())))))(())()(()()))(()()))())(()((((()()(()(()()()))))())))))((()))()()(()())()))(((()(()()()(((((((()(()))(())(((()()()((())))(()((()()())()))())))())())(())()(((()))(()))(()())((((()(()(()()))((()))(())()(((((())))())))(((()())((((()))((())(((((((()()((((((((())(((()((((()())))))(((())((((())()((()()()()))))(()(((((()()())))))()())(()(())()((((()))(())(())(((((((())())((()((()(()(()())()((())((((()(((((((()))(())(()())(()())(()()()(())())))(((())((()()))))())())
Output: 74

Example 2:

Input: ))(())(()(()()())()()(()(((()()(()))())()))(((()())(()())()))))))))))(((()())((()((((())()))))((()(())))()))()())((()))))((((()()((()())())))(((()))(())((((()())(()()()()(((((()(())(())()()()))((())(()))(((()()())()())()(()())())()(()))()()((((()())()))))()(((((()((()()(((()()(((())(()((()(((())(()()))))()()(())()())(()(()))())))()()(())(())))))(())))(()(()(()((()()))(()()()))(())))()(())()))()))(()())(((()()(())((()))((()())(())()(((()((())))))))(())))(()))(((())())))()(()(((()))((()()(()))))()()()())((())()(())()))))(()(()(())))))((((()))((())))))((((()())(()(()()))))()))((())))()(())(()())()(((((())()((((())()((()))))(())()))(()))))(()(((()(())((((()))()(()()))()((())((()()))(())()))())(((((())(()()(()))))())()))(())))()(()())()))(()))((()()()(()))((())))())(()()()())((()))((())(())()(())))()((()))()()((()(())(((((()())(())
Output: 24

Example 3:

Input: )))(((()()()(())()(((()))())))((())(())))((((((()(()()())))())((())(()()())()()(()))()(()((())()(()((((()))(()(()((((()()((()()(()(()(()()))))(()()())()())(((()())))))())))())((())))))()()(()()()(()(()((())(((((())()))))())))()((())))))()))(())(()()()))()(())((((((()(((())))))(()((((()(((())(((((())()())((())))())))))())((()(()()))())()))))((((((())(())(((((()))()(((((((()((((()(()()(())()())()((()()))(((())())((())(((((((()())(()(()(()()(((())()())))((()()))(())()))((()(()))())()())(())())())))()()(()()()))(())(())()))())
Output: 24

Constraints:

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

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