My algorithm is to consider every cake A from big to small to check whether Vovan can get. If Vovan wants to get cake A rather than B, he position must be in a certain arc in the cirlce, and the common part of these arcs is the available position. If the common part exists, then there is a solution that Vovan can get cake A.
I've checked my program for many times, but I don't know why I get Wrong Answer at #28. Please help me~

Edited by author 15.03.2007 11:59