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.

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 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.)

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
Vamsi Krishna Avula: 2014-10-30 10:33:10

There is a '\r' at the end of every line in input, those who code in Python, take care of that.

mayank: 2014-10-05 19:14:52

Well, it is "stable" as well as "balanced", only thing which kept me from submitting the code (really). :P

S: 2014-09-01 17:05:26

do not use getline to take input i am getting runtime error with that . changed it to cin AC:D

Abdelrahman Othman Helal: 2014-08-24 08:15:28

Thanks :D

mohsin mohammad: 2014-08-14 15:22:48

Compiler..Good problem..

||N0VICE||: 2014-08-02 20:53:30

Not reading problem statement carefully costed me tle
beware there may be any number of dashes at end if input!!
easy problem though

Darren Sun: 2014-07-26 03:41:35

I mistook the dot for a colon...
BTW, the test cases do not include empty string, which is stable by itself. Inclusion of it may lead to NZEC for a number of accepted submissions.

ravjit singh uppal: 2014-07-17 20:16:43

sigsev!!!
runs perfectly on my pc for an expression of length 2100! wats wrong here

The Exorcist: 2014-06-10 07:57:47

@robin Nobody cares....

robin: 2014-06-10 04:13:51

this is the fifth problem consecutively that i couldn't solve...:(


Added by:Mohammad Kotb
Date:2009-11-28
Time limit:3.236s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64 BASH JS-RHINO
Resource:http://www.icpc-anarc.org