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:

  1. An empty string is stable.
  2. If S is stable, then {S} is also stable.
  3. 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 visa-versa.


Your program will be tested on one or more data sets. Each data set is described on a single line. The line is a non-empty 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.)


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.



Output: 1. 2
2. 0
3. 1

hide comments
omprakash_40: 2017-04-10 07:02:43

don't go after dynamic programming tag..
use stack is very easy using stack....AC .

vivace: 2017-04-01 01:29:59

read the question carefully @a_kk
and also see the output format carefully . I got 2 WAs because of that .

Last edit: 2017-04-01 02:43:17
a_kk: 2017-03-24 16:28:35

what will be the answer for {{}

vladimira: 2017-03-16 05:14:23

AC in 3rd go becouse smth wrong with input, reading by lines.

nilabja16180: 2017-02-26 16:38:03

Stack, AC in one GO!
Couldn't think of solution without stack!

manas0008: 2017-02-05 14:54:01

<!----Spoilers ahead--->
Donot depend on the tags.Think it a first question of a contest.

ashishsb95: 2017-01-24 06:45:19

u can avoid stack by keeping track of the open braces count!

thekidnamedme: 2017-01-09 12:07:51

Believe it or not, I used Levenshtein Distance for this. AC in 3rd go :(

praney_rai: 2016-12-30 20:36:03

dp tag is just for fun!!
pure adhoc-implementation of stack...

sherlocklives: 2016-12-28 09:07:16

k._n where _ is a whitespace.

Added by:Mohammad Kotb
Time limit:3.236s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64 BASH JS-RHINO