2013年8月19日

HDU 1695 GCD （欧拉函数+容斥原理)

摘要： GCDTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4272Accepted Submission(s): 1492Problem DescriptionGiven 5 integers: a, b, c, d, k, you're to find x in a...b, y in c...d that GCD(x, y) = k. GCD(x, y) means the greatest common divisor of x an 阅读全文

posted @ 2013-08-19 23:25 kuangbin 阅读(2825) 评论(0) 推荐(0) 编辑

【转】[专题学习][计算几何]

摘要： 原文地址：http://www.cnblogs.com/ch3656468/archive/2011/03/02/1969303.html基本的叉积、点积和凸包等东西就不多说什么了，网上一搜一大堆，切一些题目基本熟悉了就差不多了。 一些基本的题目可以自己搜索，比如这个blog：http://blog.sina.com.cn/s/blog_49c5866c0100f3om.html 接下来，研究了半平面交，思想方法看07年朱泽园的国家队论文，模板代码参考自我校大牛韬哥：http://www.owent.net/2010/10/acm-%E8%AE%A1%E7%AE%97%E5%87%A0%E.. 阅读全文

posted @ 2013-08-19 12:42 kuangbin 阅读(3059) 评论(0) 推荐(3) 编辑

POJ 1755 Triathlon （半平面交）

摘要： TriathlonTime Limit:1000MSMemory Limit:10000KTotal Submissions:4733Accepted:1166DescriptionTriathlon is an athletic contest consisting of three consecutive sections that should be completed as fast as possible as a whole. The first section is swimming, the second section is riding bicycle and the th 阅读全文

posted @ 2013-08-19 00:37 kuangbin 阅读(1532) 评论(0) 推荐(0) 编辑

导航

JAVASCRIPT: