
计算几何
文章平均质量分 82
black_miracle
这个作者很懒,什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
POJ 2318 点在直线的两侧
TOYS Time Limit: 2000MS Memory Limit: 65536K Description Calculate the number of toys that land in each bin of a partitioned toy box. Mom and dad have a problem原创 2016-08-15 18:09:31 · 346 阅读 · 0 评论 -
POJ 3304 直线和线段相交
Segments Time Limit: 1000MS Memory Limit: 65536K Given n segments in the two dimensional space, write a program, which determines if there exists a line such that原创 2016-08-15 19:51:02 · 261 阅读 · 0 评论 -
POJ 1265 pick公式
Area Time Limit: 1000MS Memory Limit: 10000K Description Being well known for its highly innovative products, Merck would definitely be a good target for industri原创 2016-08-15 20:51:38 · 356 阅读 · 0 评论 -
UVA 11178 旋转边求交点
题意:给你三角形的三个点A,B,C,求他们角的三等分线相交组成的等边三角形的坐标。 题解:简单计算几何,用好旋转即可。 #include #include #include #include #include using namespace std; #define pi acos(-1.0) #define eps 1e-8 struct node{ double x,y;原创 2016-08-16 10:45:22 · 260 阅读 · 0 评论 -
POJ 2826 计算几何模板
An Easy Problem?! Time Limit: 1000MS Memory Limit: 65536K Description It's raining outside. Farmer Johnson's bull Ben wants some rain to water his flowers. Ben na原创 2016-08-17 17:37:17 · 314 阅读 · 0 评论 -
吃巧克力 计算几何
吃巧克力 Time Limit: 1000MS Memory Limit: 1000K Description CYF 喜欢吃巧克力,有一天,CYF收到了一份镶嵌在平面直角坐标系上的巧克力,这个巧克力的形状是一个正多边形。日子一天天过去,CYF吃完了这份巧克力,但是却忘记了自己吃的巧克力有几条边,只记得正多边形巧克原创 2016-12-20 20:45:10 · 884 阅读 · 0 评论 -
Codeforces 682E 计算几何
Alyona and Triangles time limit per test 3 seconds memory limit per test 256 megabytes input standard input output standard output You are given n points with integer co原创 2017-02-08 21:37:57 · 739 阅读 · 0 评论 -
SPOJ BLMIRINA 计算几何
Archery Training #geometry Mirana is an archer with superpower. Every arrow she shoots will get stronger the further it travels. Mirana is currently on the way to warzone. Since the road原创 2017-03-06 20:01:42 · 615 阅读 · 0 评论 -
Codeforces 800B 计算几何
Volatile Kite time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output You are given a convex polygon P with n disti原创 2017-04-17 15:24:23 · 723 阅读 · 0 评论