|
||||||||||
Clarke and five-pointed starTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1010 Accepted Submission(s): 554 Problem Description Clarke is a patient with multiple personality disorder. One day, Clarke turned into a learner of geometric. When he did a research with polygons, he found he has to judge if the polygon is a five-pointed star at many times. There are 5 points on a plane, he wants to know if a five-pointed star existed with 5 points given. Input The first line contains an integer $T(1 \le T \le 10)$, the number of the test cases. For each test case, 5 lines follow. Each line contains 2 real numbers $x_i, y_i(-10^9 \le x_i, y_i \le 10^9)$, denoting the coordinate of this point. Output Two numbers are equal if and only if the difference between them is less than $10^{-4}$. For each test case, print $Yes$ if they can compose a five-pointed star. Otherwise, print $No$. (If 5 points are the same, print $Yes$. ) Sample Input
Sample Output
Hint Source | ||||||||||
|