U268905 [USACO08FEB]Cow Game G

The cows have just discovered a new game to play with Farmer John. Each of the N (2

This is an output-only problem. For each case, it is possible for Cow N to be on the same spot with Cow 1. Should you produce an answer where the total distance from Cow 1 to Cow N is x, you will receive a integer version of (1000-x)/1000 of the points for that test case. Each test case begins with CASE (1

OUTPUT FORMAT: * Line 1: A line like this where ID is the case number: #FILE cgame ID * Lines 2..N+1: The locations of each of the cows to minimize this sum. Line i+1 should contain the x and y coordinates of cow i in that order.

INPUT DETAILS: There are 5 cows. The distance from Cow 1 to Cow 2 is (2, 6), the distance from Cow 2 to Cow 3 is (3, 1), the distance from Cow 3 to Cow 4 is (1, 4) and the distance from Cow 4 to Cow 5 is (4, 3). OUTPUT DETAILS: This case receives full points since it gives a valid assignment and the locations of cows 1 and N overlap.