-->
当前位置:首页 > 题库

PROGRAMMING:Isolated Pointset

Luz5年前 (2021-05-10)题库476
On a two-dimensional plane, $$YHH$$ has a series of isolated points named PointSet, which contains $$N$$ points in it. $$YHH$$ would like to know if there is a way to draw a vertical bisector from any two points in the PointSet, passing through at least one point in the PointSet. Please help him.
### Input Specification:
There are multiple test cases. The first line contains an integer $$T$$ ($$1$$ ≤ $$T$$ ≤ $$2$$ × $$ 10^5$$), indicating the number of test cases. For each test case:
Then followed $$T$$ lines, each line contains an integer $$N$$ ($$1$$ ≤ $$N$$ ≤ $$2$$ × $$ 10^5$$), indicating the number of points in the PointSet.
### Output Specification:
If there is a way to solve this problem, output "Yes"(without quotes), otherwise, output "No"(without quotes) instead.
### Sample Input:
```in
two
four
five
```
### Sample Output:
```out
Yes
Yes
```
### Hint:
Vertical bisector: Line $$CD $$is a * * vertical bisector * *
![ Vertical bisector. PNG] (~ / 9462accc-b277-4406-97d5-911bb7585c81. PNG)
For the first sample, $$YHH$$ can construct two equilateral triangles $$ABD$$, $$BDC$$ as shown below.
![ sample1.png](~/e23e8cbe-f903-4c6a-b6f2-4b8481cf181a.png)
For the second sample, $$YHH$$ can construct three equilateral triangles $$ABE$$, $$BCE$$, $$CDE$$ as shown below.
![ sample2.png](~/f09981b4-8abe-47bc-9d19-255b237fcc24.png)







answer:If there is no answer, please comment