计量大学 I Isolated Pointset

I Isolated Pointset

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:

2
4
5

Sample Output:

Yes
Yes

题意

判断n个顶点构成的图案，他们任意两点的中垂线是否能够经过其他点（同集合内）。

简析

结论题，只有$n<=2$是非法态，否则一直构造等边三角形就能构成合法态。

参考代码

#include <bits/stdc++.h>
using namespace std;
const int N = 1000;
int c[N];

int solve(int &n) {
	if (n <= 2) return false;
	return true;
}

int main() {
	// freopen("in.txt", "r", stdin);
	int t;
	cin >> t;
	while (t--) {
		int n;
		cin >> n;
		puts(solve(n) ? "Yes" : "No");
	}
	return 0;
}