蓝色污点的专栏

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

<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

 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

<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

<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

下面的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

http://poj.org/problem?id=1434Fill the Cisterns!Time Limit: 5000MS Memory Limit: 10000KTotal Submissions: 1806 Accepted: 653Descri

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