
Originariamente Scritto da
fedex
The input file will contain one or more test cases. The first line of each test case will contain the number of stones
n (

). The next
n lines each contain two integers
xi,
yi (

) representing the coordinates of stone #
i. Stone #1 is Freddy's stone, stone #2 is Fiona's stone, the other
n-2 stones are unoccupied. There's a blank line following each test case. Input is terminated by a value of zero (0) for
n.
Segnalibri