Vmorish

POJ - 3304 Segments（计算几何） Description Given n segments in the two dimensional space, write a program, which determines if there exists a line such that after projecting these segments on it, all projected segments have at least one point in common. Input

原文地址:http://blog.csdn.net/zsc09_leaf/article/details/6331809 快出去比赛了,这三四天尽量多刷一点计算几何的题了,emmmm紧张诶 //第一期 计算几何题的特点与做题要领： 1.大部分不会很难，少部分题目思路很巧妙 2.做计算几何题目，模板很重要，模板必须高度可靠。 3.要注意代码的组织，因为计算几何

Description Your friend to the south is interested in building fences and turning plowshares into swords. In order to help with his overseas adventure, they are forced to save money on buying fence posts by using trees as fence posts wherever possible. Gi

HDU - 4128 Running relay（贪心+凸包+三分） Problem Description The school track-and-field team is taking a running relay race. There are n (2<=n<=104) members in the team. In order to let everybody participate in the race, each member should run at least d (0<=d<

ZOJ - 3806 Incircle and Circumcircle（计算几何+二分） A triangle is one the basic shapes in geometry. It's a polygon with three vertices and three sides which are line segments. A triangle with vertices A, B, C is denoted ΔABC. And its three sides, BC, CA, AB are

POJ - 2398 Toy Storage（计算几何） Description Mom and dad have a problem: their child, Reza, never puts his toys away when he is finished playing with them. They gave Reza a rectangular box to put his toys in. Unfortunately, Reza is rebellious and obeys his pa

POJ - 2318 TOYS(计算几何) Description Calculate the number of toys that land in each bin of a partitioned toy box. Mom and dad have a problem - their child John never puts his toys away when he is finished playing with them. They gave John a rectangular box

ZOJ - 3574 Under Attack II(计算几何 归并排序) Because of the sucessfully calculation in Under Attack I, Doctor is awarded with Courage Cross and promoted to lieutenant. But the war seems to end in never, now Doctor has a new order to help anti-aircraft troops calc

点我看题 题意:给你n个整数点(这个条件超级重要),rang 求能组成多少个正多边形. 分析:由整数点组成的正多边形只能是正方形,可以画个图看看,发现怎么也找不到除了正四边形以外的其他形状.然后对于每一条边,分别找出它左右两边能与他形成正方形的另外两个点,然后看看这两个点是否存在.最后的答案要除以一个4,因为对于每一个正方形来说,你都通过四个边找了它四次. 参考代码: #include #

（2017多校6）1002/hdu-6097 Mindis(计算几何) Problem Description The center coordinate of the circle C is O, the coordinate of O is (0,0) , and the radius is r. P and Q are two points not outside the circle, and PO = QO. You need to find a point D on the circle, wh

点我看题 题意：给出两条直线，判断这两条直线的关系，即问是否相交，如果相交求出交点，如果不相交，那么他们是相离还是重合？ 分析：首先去判断直线P1P2和Q1Q2和是否平行，判断直线平行可以利用叉乘。 如果（P2-P1）×（Q2-Q1）== 0的话，那么两直线平行； 得到直线平行，就要看是否重合了。 判断重合就相当于判断一条直线上的点是否存在于另一条直线上，假设这里我们看P1是否在Q1Q2

Problem Description On an infinite smooth table, there's a big round fixed cylinder and a little ball whose volume can be ignored. Currently the ball stands still at point A, then we'll give it an initial speed and a direction. If the ball hits the cylind