ANARC09A  Seinfeld
I’m out of stories. For years I’ve been writing stories, some rather silly, just to make simple problems look difficult and complex problems look easy. But, alas, not for this one.
You’re given a non empty string made in its entirety from opening and closing braces. Your task is to find the minimum number of “operations” needed to make the string stable. The definition for being stable is as follows:
 An empty string is stable.
 If S is stable, then {S} is also stable.
 If S and T are both stable, then ST (the concatenation of the two) is also stable.
All of these strings are stable: {}, {}{}, and {{}{}}; But none of these: }{, {{}{, nor {}{.
The only operation allowed on the string is to replace an opening brace with a closing brace, or visaversa.
Input
Your program will be tested on one or more data sets. Each data set is described on a single line. The line is a nonempty string of opening and closing braces and nothing else. No string has more than 2000 braces. All sequences are of even length.
The last line of the input is made of one or more ’’ (minus signs.)
Output
For each test case, print the following line:
k. N
Where k is the test case number (starting at one,) and N is the minimum number of operations needed to convert the given string into a balanced one.
Example
Input: }{
{}{}{}
{{{}

Output: 1. 2
2. 0
3. 1
hide comments
manas0008:
20170205 14:54:01
<!Spoilers ahead>


ashishsb95:
20170124 06:45:19
u can avoid stack by keeping track of the open braces count!


thekidnamedme:
20170109 12:07:51
Believe it or not, I used Levenshtein Distance for this. AC in 3rd go :( 

praney_rai:
20161230 20:36:03
dp tag is just for fun!!


sherlocklives:
20161228 09:07:16
k._n where _ is a whitespace.


sherlocklives:
20161228 09:06:28
k._n where _ is a whitespace.


vengatesh15:
20161224 07:46:46
AC in 1 go simple stack Approach 

aakash_s:
20161223 14:50:10
Can anyone tell me why spoj said " You improved your score in Seinfield , Your previous score was 429"? It's classical not challenge. 

akashranjan28:
20161210 20:29:45
AC in 1 go... used stack approach :) 

ta4ibanakanade:
20161208 06:52:28
How to solve with DP?

Added by:  Mohammad Kotb 
Date:  20091128 
Time limit:  3.236s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 BASH JSRHINO 
Resource:  http://www.icpcanarc.org 