翻译练习 Day17

题目:Tetragon | JXNUOJ

翻译:

Tetragon

3000ms 262144K

描述:

You're given the centers of three equal sides of a strictly convex tetragon. Your task is to restore the initial tetragon.

给你一个严格的凸四边形的三个等边的中心。你的任务是恢复最初的四边形。

输入:

The first input line contains one number T — amount of tests (1 ≤ T ≤ 5·104). Each of the following T lines contains numbers x1, y1, x2, y2, x3, y3 — coordinates of different points that are the centers of three equal sides (non-negative integer numbers, not exceeding 10).

第一个输入行包含一个数字T ——测试数量。下面的每一条T线包含数字x1, y1, x2, y2, x3, y3——三个等边的中心的不同点的坐标(非负整数,不超过10)。

输出:

For each test output two lines. If the required tetragon exists, output in the first line YES, in the second line — four pairs of numbers — coordinates of the polygon's vertices in clockwise or counter-clockwise order. Don't forget, please, that the tetragon should be strictly convex, i.e. no 3 of its points lie on one line. Output numbers with 9 characters after a decimal point.

对于每个测试输出两行。如果需要的四边形存在,则在第一行输出YES,在第二行中——四对数字——按顺时针或逆时针顺序输出多边形顶点的坐标。请不要忘记,这个四边形应该是严格凸的,也就是说,它的任何3个点都不在一条线上。保留小数点后9位

If the required tetragon doen't exist, output NO in the first line, and leave the second line empty.

如果四边形不存在,则在第一行输出NO,并让第二行为空。

样例输入:

3
1 1 2 2 3 3
0 1 1 0 2 2
9 3 7 9 9 8

样例输出:

NO

YES
3.5 1.5 0.5 2.5 -0.5 -0.5 2.5 0.5
NO
上一篇:border, boundary


下一篇:用Python将数据自动转成Execl实现自动化办公