Thanx You!!

The problem is same as to calculate the following

If n vertices are identical
No. of ways to form one garland = 1
No. of ways to find more that one garland = x

Our answer = 1/x

x is no. of ways you can distribute n identical objects into more than 1 partition

x can be calculated

Just a small observation.. ofcourse the solution by union find is great… but in case the number of assertions we make are really exhaustive, i.e. for n balls, i.e m approximately equal to mn(n+1)/2, we can do it in O(n^2), hence O(m) by using table filling algorithm {as used in many Theory of Computation Algorithms}… I hope I am correct… This algorithm is O($n^2$)… Whether this is better than O($m\alpha(n)$) is debatable

Keep it up…

Similar puzzle
http://pratikpoddarcse.blogspot.com/2009/08/puzzle-whats-number-on-my-hat.html

but we also need to find the columns(p,q) which will lead us to maximum subarray..

so for finding p and q should i maintain k*(p+q) variables or is there any method by which i can compute the same in less space.

Your blog is really fantastic I really liked many of the puzzles/questions here.

Good work,

Thanks for sharing the knowledge.

Cheers!