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
ronak66:
20180517 14:17:45
can anyone provide me a test case where there is a possibility of wrong answer?? 

shashankpathak:
20180513 16:37:47
Good question on stack


coderslegacy:
20180420 19:02:06
Simply use concept of stacks


jopmastah:
20180404 13:36:11
{{whitespace}} or {{ }} is a possible case


chaitya62:
20180222 11:21:22
I don't understand how is it a dp problem 

chunky_2808:
20180121 15:15:35
getline working! 

aniket000:
20180110 08:28:09
yaaay, took time, but finally, AC in 2nd :D 

cipher098:
20180104 20:51:23
WA's due to getline ;(


ameyanator:
20171221 16:55:11
wrong tag :/ Last edit: 20180125 11:59:49 

vishesh197:
20171215 10:24:19
can be done with dp as well as stack and adhoc as well...But better use stack to understand problem concept..key is to keep track of open braces 
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 