Now it's harder. For arbitrary image, you'll have to identify where
the circle is. But Jame's answer seems fine if the ONLY thing on the
picture is the circle and the two segments. just look for the left
most intersection and the right most intersection then follow the
line.
On Jan 4, 5:15 pm,
Well, actually that only solves for when the # of players and events
are same, what if there're more players than events?
The recursion you describe has exponential growth rate. f(c) for some
set of P's can't really be cached, because the number of possible c's
is just are huge as exponential.
