摘要： Ignatius and the Princess ITime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5989Accepted Submission(s): 1816Special JudgeProblem DescriptionThe Princess has been abducted by the BEelzebub feng5166, our hero Ignatius has to rescue our pretty Princess 阅读全文

摘要： Scrambled PolygonTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 4849Accepted: 2293DescriptionA closed polygon is a figure bounded by a finite number of line segments. The intersections of the bounding line segments are called the vertices of the polygon. When one starts at any vertex of a 阅读全文

摘要： Space AntTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 1799Accepted: 1147DescriptionThe most exciting space discovery occurred at the end of the 20th century. In 1999, scientists traced down an ant-like creature in the planet Y1999 and called it M11. It has only one eye on the left side o 阅读全文

摘要： 移动 IITime Limit: 1000 MSMemory Limit: 65536 KTotal Submit: 27(14 users)Total Accepted: 16(14 users)Special Judge: NoDescription在坐标轴[0,500]上存在两点A,B。点A可以多次移动，每次移动需要遵循如下规则：1.向后移动一步。2.向前移动一步。3.跳到当前坐标*2的位置上。要求：利用宽搜算法编程求解从A移动到B的步数最少的方案，为使答案统一，要求搜索按照规则1、2、3的顺序进行。Input输入包含多组测试用例。每组测试用例要求输入两个整数A,B。Output按要求输 阅读全文

摘要： 告诉大家一种保护眼睛的好方法： 桌面->右键->属性->外观->高级－>项目选择（窗口）、颜色1（L）选择（其它）将色调改为：85。饱和度：123。亮度：205－>添加到自定义颜色－>在自定义颜色选定点确定－>确定 这样所有的文档都不再是刺眼的白底黑字，而是非常柔和的豆沙绿色，这个色调是眼科专家配置的，长时间使用会很有效的缓解眼睛疲劳保护眼睛 阅读全文

摘要： Climbing WormTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7047Accepted Submission(s): 4455Problem DescriptionAn inch worm is at the bottom of a well n inches deep. It has enough energy to climb u inches every minute, but then has to rest a minut 阅读全文

摘要： Constructing Roads In JGShining's KingdomTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7192Accepted Submission(s): 2103Problem DescriptionJGShining's kingdom consists of 2n(n is no more than 500,000) small cities which are located in two 阅读全文

摘要： http://acm.hrbust.edu.cn/index.php?m=ProblemSet&a=showProblem&problem_id=1100矩阵相乘法A Strange Dog called Vagaa IITime Limit: 1000 MSMemory Limit: 65536 KTotal Submit: 105(32 users)Total Accepted: 29(23 users)Special Judge: NoDescriptionLeyni has a strange dog called Vagaa and it is just born.( 阅读全文

摘要： Train Problem IITime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2830Accepted Submission(s): 1562Problem DescriptionAs we all know the Train Problem I, the boss of the Ignatius Train Station want to know if all the trains come in strict-increasing o 阅读全文

摘要： 卡特兰数又称卡塔兰数，是组合数学中一个常出现在各种计数问题中出现的数列。由以比利时的数学家欧仁·查理·卡塔兰 (1814–1894)命名。卡特兰数前几项为 （OEIS中的数列A000108）: 1, 1, 2, 5, 14, 42, 132, 429, 1430, 4862, 16796, 58786, 208012, 742900, 2674440, 9694845, 35357670, 129644790, 477638700, 1767263190, 6564120420, 24466267020, 91482563640, 343059613650, 1289904 阅读全文