OJ Board

I have the following problem.

From a given number N <= 100, where N is the length of the string, i need to find K, where K is the number of correct strings.

Strings consists of round bracket expressions. Every position in string can assume either "(" or ")".

Correct round bracket expression ...