![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
计算几何
文章平均质量分 83
zsc09_leaf
add oil
展开
-
hdu 2056 -- Rectangles (矩形重合)
2056 -- Rectangles (矩形重合)RectanglesTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5731 Accepted Submission(s): 1802Problem DescriptionGiven two rectangles and the coordinates of two points on the diagon原创 2011-02-16 13:27:00 · 2271 阅读 · 0 评论 -
pku 1220--NUMBER BASE CONVERSION(高精度进制转换)
<br /><br />NUMBER BASE CONVERSIONTime Limit: 1000MS Memory Limit: 10000K<br />Total Submissions: 3000 Accepted: 1277<br /><br /><br />Description<br />Write a program to convert numbers in one base to numbers in a second base. There are 62 different dig原创 2011-03-05 15:33:00 · 1589 阅读 · 1 评论 -
pku 2002 -- Squares(二分,几何)
SquaresTime Limit: 3500MS Memory Limit: 65536KTotal Submissions: 8787 Accepted: 3051DescriptionA square is a 4-sided polygon whose sides have equal length and adjacent sides form 90-degree angles. It is also a polygon such that rotating abou原创 2011-02-24 12:22:00 · 1257 阅读 · 0 评论 -
poj 2668 -- Defending Castle(数学题)
<br />Defending CastleTime Limit: 2000MS Memory Limit: 65536K<br />Total Submissions: 4559 Accepted: 1060<br /><br /><br />Description<br />The kingdom Eintagra is in great danger! Overwhelming enemy has surrounded the emperor's castle and once they ente原创 2011-03-30 20:26:00 · 1482 阅读 · 1 评论 -
poj 1730 -- Perfect Pth Powers
<br />http://poj.org/problem?id=1730<br /> <br />Perfect Pth PowersTime Limit: 1000MS Memory Limit: 10000K<br />Total Submissions: 11102 Accepted: 2475<br /><br /><br />Description<br />We say that x is a perfect square if, for some integer b, x = b2. Si原创 2011-04-01 20:50:00 · 932 阅读 · 0 评论 -
ACM计算几何题目推荐
下面的OJ之中,CII是指ACM-ICPC Live Archive ,网址是:http://cii-judge.baylor.edu/其他OJ的地址大家都熟知了,因此不再提供。一。基础题目1.1 有固定算法的题目A, 最近点对问题最近点对问题的算法基于扫描线算法。ZOJ 2107 Quoit Design 典型最近点对问题POJ 3714 Raid 变种最近点对问题B,最小包围圆最小包围圆的算法是一种增量算法,期望是O(n)。ZOJ 1450 Minimal转载 2011-04-18 18:22:00 · 15463 阅读 · 1 评论 -
poj 1434 --Fill the Cisterns!(计算几何,二分)
http://poj.org/problem?id=1434Fill the Cisterns!Time Limit: 5000MS Memory Limit: 10000KTotal Submissions: 1806 Accepted: 653Descri原创 2011-07-06 15:54:36 · 1730 阅读 · 0 评论 -
poj 1023 --The Fun Number System(分析题)
The Fun Number SystemTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 6988 Accepted: 2176DescriptionIn a k bit 2's complement number, where the bits are indexed from 0 to k-1, the w原创 2011-03-31 16:39:00 · 3251 阅读 · 4 评论