摘要： Ignatius's puzzleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2737 Accepted Submission(s): 1805Problem DescriptionIgnatius is poor at math,he falls across a puzzle problem,so he has no choice but to appeal to Eddy. this problem describes th 阅读全文

摘要： A hard puzzleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13563 Accepted Submission(s): 4724Problem Descriptionlcy gives a hard puzzle to feng5166,lwg,JGShining and Ignatius: gave a and b,how to know the a^b.everybody objects to this BT problem 阅读全文

摘要： MilkTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5780 Accepted Submission(s): 1320Problem DescriptionIgnatius drinks milk everyday, now he is in the supermarket and he wants to choose a bottle of milk. There are many kinds of milk in the superm 阅读全文

摘要： 在学习了一些有关计算机几何的基础知识和一些基本工具之后要快速的解决一些简单的几何问题，如两点之间的距离、两线段的交点个数等等是可以轻松应付的，但是对于复杂点的几何问题，我们还是要有更好的算法，这样才可以更高效的解决它。在这一篇中来总结 平面凸包 的 Graham算法；http://www.cnblogs.com/jbelial/平面凸包 ：定义：对一个简单多边形来说，如果给定其边界上或内部的任意两个点，连接这两个点的线段上的所有点都被包含在该多边形的边界上或内部的话，则该多边形为凸多边形 。在解决平面凸包下面介绍了两种算法：一、 Graham扫描法，运行时间为O(nlgn)。二、 Jarvi. 阅读全文

摘要： Surround the TreesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3312 Accepted Submission(s): 1268Problem DescriptionThere are a lot of trees in an area. A peasant wants to buy a rope to surround all these trees. So at first he must know the mini 阅读全文