|
||||||||||
Circles GameTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2318 Accepted Submission(s): 745 Problem Description There are n circles on a infinitely large table.With every two circle, either one contains another or isolates from the other.They are never crossed nor tangent. Alice and Bob are playing a game concerning these circles.They take turn to play,Alice goes first: 1¡¢Pick out a certain circle A,then delete A and every circle that is inside of A. 2¡¢Failling to find a deletable circle within one round will lost the game. Now,Alice and Bob are both smart guys,who will win the game,output the winner's name. Input The first line include a positive integer T<=20,indicating the total group number of the statistic. As for the following T groups of statistic,the first line of every group must include a positive integer n to define the number of the circles. And the following lines,each line consists of 3 integers x,y and r,stating the coordinate of the circle center and radius of the circle respectively. n¡Ü20000£¬|x|¡Ü20000£¬|y|¡Ü20000£¬r¡Ü20000¡£ Output If Alice won,output ¡°Alice¡±,else output ¡°Bob¡± Sample Input
Sample Output
Author FZUACM Source | ||||||||||
|