Given a n vertex polygon, find in how many ways k non intersecting diagonals can be drawn ? or in How many ways it can be divided into k+1 regions such that no 2 diagonals intersect ?
Limits: 1 <= k <= N <= 10^9 -- Sunny Aggrawal B.Tech. V year,CSI Indian Institute Of Technology,Roorkee -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
