当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

5738:Eureka

题目描述
Professor Zhang draws $n$ points on the plane, which are conveniently labeled by $1, 2, ..., n$. The $i$-th point is at $(x_i,y_i)$. Professor Zhang wants to know the number of best sets. As the value could be very large, print it modulo $10^9+7$.

A set $P$ ($P$ contains the label of the points) is called best set if and only if there are at least one best pair in $P$. Two numbers $u$ and $v$ $(u, v \in P, u \ne v)$ are called best pair, if for every $w \in P$, $f(u,v) \ge g(u,v,w)$, where $f(u,v)=\sqrt{(x_u-x_v)^2+(y_u-y_v)^2}$ and $g(u,v,w)=\frac{f(u,v)+f(v,w)+f(w,u)}{2}$.
输入解释
There are multiple test cases. The first line of input contains an integer $T$, indicating the number of test cases. For each test case:

The first line contains an integer $n$ $(1 \le n \le 1000)$ -- then number of points.

Each of the following $n$ lines contains two integers $x_i$ and $y_i$ $(-10^9 \le x_i, y_i \le 10^9)$ -- coordinates of the $i$-th point.
输出解释
For each test case, output an integer denoting the answer.
输入样例
3
3
1 1
1 1
1 1
3
0 0
0 1
1 0
1
0 0
输出样例
4
3
0
来自杭电HDUOJ的附加信息
Author zimpha
Recommend wange2014

该题目是Virtual Judge题目,来自 杭电HDUOJ

源链接: HDU-5738

最后修改于 2020-10-25T23:25:15+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
8000/4000MS(Java/Others) 65536/65536K(Java/Others)