http://en.wikipedia.org/wiki/Happy_Ending_problem#Empty_polygons
On Mon, Apr 19, 2010 at 5:09 AM, std...@gmail.com std...@gmail.com wrote:
I am trying to solve the following problem:
Given a set of (x,y)-points P find a subset P' of P such that the
convex hole of P', CH(P') contains all
Let the 2 missing numbers be a and b .
Let the sum of the 2 missing numbers be S , product be P .
a+b=S -(1)
ab=P -(2)
Solve (1) and (2)
On Wed, Jul 29, 2009 at 7:30 PM, Vikram Sridar vikramsridar...@gmail.comwrote:
nice one channa.. much like my solution.. same complexity n memory
