几何
Nothing_227
Nothing is impossible!
展开
-
计蒜客_计算坐标重心
方法:枚举所有点间距离在二维平面上有很多点,这些点的重心定义为:到其他所有点的距离的平均值最小的一个点。你需要输出这个距离其他点的平均值最小的点的编号,所有点的编号从 11 开始。如果存在多个平均值最小的点,输出编号最大的那一个。(距离为欧几里德距离)输入格式第一行输入一个整数 n(1 \le n \le 1000)n(1≤n≤1000)。接下来一共 nn 行,每行两个整数,表示每个点的横坐标和纵...原创 2018-07-16 15:28:48 · 1202 阅读 · 0 评论 -
判断两线段相交
You can Solve a Geometry Problem too HDU - 1086 Many geometry(几何)problems were designed in the ACM/ICPC. And now, I also prepare a geometry problem for this final exam. According to the exper...原创 2018-06-05 19:48:02 · 268 阅读 · 0 评论 -
Pick-up sticks POJ - 2653
Stan has n sticks of various length. He throws them one at a time on the floor in a random way. After finishing throwing, Stan tries to find the top sticks, that is these sticks such that there is no ...原创 2018-07-25 11:32:39 · 204 阅读 · 0 评论 -
Lifting the Stone HDU - 1115 (求多边形的重心)
There are many secret openings in the floor which are covered by a big heavy stone. When the stone is lifted up, a special mechanism detects this and activates poisoned arrows that are shot near the o...翻译 2018-07-25 14:45:59 · 199 阅读 · 0 评论 -
计蒜客——圈果树
传送门小马承包了一个果园,想修一个围栏,但是不希望砍掉任何的果树。对于给出的所有的果树的坐标,计算一下最小的围住所有的果树的围栏的长度。输入数据的第一行包括一个整数 N(0≤ N ≤10,000)表示农夫约翰想要围住的放牧点的数目。接下来 N 行,每行由两个由空格分隔的实数组成,Xi 和 Yi,对应平面上的放牧点坐标(-1,000,000 ≤ Xi,Yi ≤ 1,000,000)。数字用小...原创 2018-08-13 10:42:44 · 186 阅读 · 0 评论 -
Angle and Squares UVA - 1643
Here is a geometric problem. You have an angle and some squares in the first quadrant of the plane rectangular coordinates. The vertex of the angle is fixed on the origin O of the coordinates, and bot...原创 2018-08-23 09:38:10 · 261 阅读 · 0 评论