帮我简单翻译着道题
Farmer John's N (1 <= N <= 1000) cows (conveniently numbered 1..N)
are going to play a game of Serious Cow Tag. In Serious Cow Tag,
each cow chooses a grid point in the pasture (-7500 <= X <= 7500,
-7500 <= Y <= 7500) such that the distances between all pairs of
cows are unique.
The cows play in turn, starting with cow #1 and continuing with
cows #2, #3, and so on (as long as the cow is still in the game).
When it is a cow's turn to play, she finds the nearest cow still
playing, ambles over to that cow to tag her, and then returns to
her original location. As soon as a cow is tagged, she is out of
the game.
The game ends when only one cow remains, and she is declared the
winner.
Farmer John is taking bets with neighboring farmers as to which cow
will win, so he would like to know the winner in advance. Write a
program that will read a description of the cows' positions and
determine the winner.
PROBLEM NAME: cowtag
INPUT FORMAT:
* Line 1: A single integer N, the number of cows
* Lines 2..N+1: Line i+1 contains two space-separated integers that
describe the location of cow i.
SAMPLE INPUT (file cowtag.in):
3
0 0
0 3
4 3
INPUT DETAILS:
Three cows at (0, 0), (0, 3) and (4, 3).
OUTPUT FORMAT:
* Line 1: The number of the winning cow.
SAMPLE OUTPUT (file cowtag.out):
3
OUTPUT DETAILS:
Cow 1 goes first and tags the nearest cow, cow 2. Cow 2 is eliminated
so she does not get a turn. Cow 3 then tags the only remaining cow,
cow 1. She is the last cow left, so she wins.
参考答案:农夫约翰的N 母牛(方便地被编号1..N) 演奏严肃的母牛标记赛。在严肃的母牛标记, 各头母牛选择一个网格点在牧场地这样, 距离在所有对母牛之间是独特的。母牛演奏反之, 从母牛#1 和继续开始与母牛# 2, # 3, 等等(只要母牛仍然是在比赛) 。当这是母牛的轮演奏, 她发现最近的母牛仍然演奏, 漫步对那头母牛标记她, 和然后回到她原始的地点。当母牛被标记, 她是在比赛外面。比赛结束当只一头母牛保留, 并且她被宣称优胜者。农夫约翰采取赌注以母牛将赢取, 因此他会想事先知道优胜者的邻居农夫。写将读母牛的位置的描述的一个节目并且确定优胜者。问题名字: cowtag 输入格式: * 线1: 一个整数N, 母牛的数量* 排行2..N+1: 线i+1 包含描述母牛地点i 的二个空间被分离的整数。样品被输入(文件cowtag.in): 3 0 0 0 3 4 3 个被输入的细节: 三头母牛在(0, 0), (0, 3) 和(4, 3) 。产品格式: * 线1: 赢取的母牛的数字。样本输出(文件cowtag.out): 3 个输出的细节: 母牛1 首先去和标记最近的母牛, 母牛2 。母牛2 被消灭因此她不得到轮。威胁3 然后标记唯一的残余的母牛, 母牛1 。她是最后母牛剩下, 因此她赢取。