摘要：
Rescue The PrincessTime Limit: 1000ms Memory limit: 65536K有疑问？点这里^_^题目描述 Several days ago, a beast caught a beautiful princess and the princess was put in prison. To rescue the princess, a prince who wanted to marry the princess set out immediately. Yet, the beast set a maze. Only if the prince find 阅读全文
摘要：
TautologyTime Limit:1000MSMemory Limit:65536KTotal Submissions:7716Accepted:2935DescriptionWFF 'N PROOF is a logic game played with dice. Each die has six faces representing some subset of the possible symbols K, A, N, C, E, p, q, r, s, t. A Well-formed formula (WFF) is any string of these symbo 阅读全文
摘要：
TilingTime Limit:1000MSMemory Limit:65536KTotal Submissions:6746Accepted:3291DescriptionIn how many ways can you tile a 2xn rectangle by 2x1 or 2x2 tiles?Here is a sample tiling of a 2x17 rectangle.InputInput is a sequence of lines, each line containing an integer number 0 <= n <= 250.OutputFo 阅读全文
摘要：
Y2K Accounting BugTime Limit:1000MSMemory Limit:65536KTotal Submissions:8282Accepted:4106DescriptionAccounting for Computer Machinists (ACM) has sufferred from the Y2K bug and lost some vital data for preparing annual report for MS Inc.All what they remember is that MS Inc. posted a surplus or a def 阅读全文
摘要：
The Pilots Brothers' refrigeratorTime Limit:1000MSMemory Limit:65536KTotal Submissions:15136Accepted:5660Special JudgeDescriptionThe game “The Pilots Brothers: following the stripy elephant” has a quest where a player needs to open a refrigerator.There are 16 handles on the refrigerator door. Ev 阅读全文
摘要：
Binary TreeTime Limit:1000MSMemory Limit:65536KTotal Submissions:5399Accepted:2502DescriptionBackgroundBinary trees are a common data structure in computer science. In this problem we will look at an infinite binary tree where the nodes contain a pair of integers. The tree is constructed like this:T 阅读全文
摘要：
Dirichlet's Theorem on Arithmetic ProgressionsTime Limit:1000MSMemory Limit:65536KTotal Submissions:13636Accepted:6808DescriptionIfaanddare relatively prime positive integers, the arithmetic sequence beginning withaand increasing byd, i.e.,a,a+d,a+ 2d,a+ 3d,a+ 4d, ..., contains infinitely many p 阅读全文
摘要：
Balanced LineupTime Limit:5000MSMemory Limit:65536KTotal Submissions:27567Accepted:12955Case Time Limit:2000MSDescriptionFor the daily milking, Farmer John'sNcows (1 ≤N≤ 50,000) always line up in the same order. One day Farmer John decides to organize a game of Ultimate Frisbee with some of the 阅读全文
摘要：
Nearest Common AncestorsTime Limit:1000MSMemory Limit:10000KTotal Submissions:14221Accepted:7596DescriptionA rooted tree is a well-known data structure in computer science and engineering. An example is shown below:In the figure, each node is labeled with an integer from {1, 2,...,16}. Node 8 is the 阅读全文
摘要：
Hawk-and-ChickenTime Limit: 6000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1259Accepted Submission(s): 360Problem DescriptionKids in kindergarten enjoy playing a game called Hawk-and-Chicken. But there always exists a big problem: every kid in this game want 阅读全文