OJ Board

Please provide me some testcases.
I've tested all I can imagine and all I get is WA...

Brute force will do it. Remember that you can greedly get the first active transition you find. This should speed up. Also, if one of the imputs do not suffice, you can also discard that transition, since it's surely not active.

My AC code gives, for this input: ((**)()a+b)[(a){a+n}] ((**)()a+b)[(a){a+n}](* ((**)()a+b)[(a){a+n}]( ((**)()a+b)[(a){a+n}]) (((**))()a+b)[(a){a+n}] [((((**))())a+b)][[(a){a+n}]] [((((**))())a+b)][[(a){a+n}]]u+i-9+(+= ()a a() ()* ()*() ()()(a+b)( [** ((((()) (*(*(*(**)*) ( ( ( ( (*) **()**(**) (not...

even though, I can't get an AC. Getting WA repeatedly

The answer is: