I only need the hint. That's all. I don't need the exact solution. Thank you.

http://www.spoj.com/problems/RIOI_2_3/

I mean how can we proceed. Can we apply dfs or bfs in this question?

How can we apply recursion in this question?

My approach is that if both the cats are diagonal to each other then only mouse can not escape otherwise it will escape. Also I have doubt When both cats are diagonal to each other is it necessary that the mouse should be in the middle of the diagonal? or it is not and we have to only for diagonal? Please correct me if i am wrong and also provide me the right approach? www.spoj.com/problems/CATM

Hello i am new to programming. I want to learn how to do bit masking? Please provide some tutorials or any books

How can i approach this problem using graphs and dynamic programming? Brute force is giving TLE. I am trying to find the all the distance from '*' to each other and then finding the minimum distance.but it's not working? Can anyone please help?

I know we can solve it using segment tree but i am not unable to proceed. There are two things we need to solve this question are that the sum should be zero (if we consider '(' as 1 and ')' as -1) and i am not able to figure out the other thing? Can you please tell the second point which is important and explain it as well?