摘要：
HangOverTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 8258 Accepted Submission(s): 3414 Problem DescriptionHow far can you make a stack of cards overhang a table? If you have one card, you can create a maximum overhang of half a card length. (W 阅读全文
摘要：
Climbing WormTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 10528 Accepted Submission(s): 6970 Problem 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 阅读全文
摘要：
The Hardest Problem EverTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 13590 Accepted Submission(s): 6212 Problem DescriptionJulius Caesar lived in a time of danger and intrigue. The hardest situation Caesar ever faced was keeping himself alive. 阅读全文
摘要：
Computer TransformationTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 5065 Accepted Submission(s): 1850 Problem DescriptionA sequence consisting of one digit, the number 1 is initially written into a computer. At each successive time step, the c 阅读全文
摘要：
Easier Done Than Said?Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 6333 Accepted Submission(s): 3145 Problem DescriptionPassword security is a tricky thing. Users prefer simple passwords that are easy to remember (like buddy), but such passwor 阅读全文
摘要：
Biker's Trip OdometerTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 3061 Accepted Submission(s): 2103 Problem DescriptionMost bicycle speedometers work by using a Hall Effect sensor fastened to the front fork of the bicycle. A magnet is atta 阅读全文
摘要：
Keep on Truckin'Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 7174 Accepted Submission(s): 4964 Problem DescriptionBoudreaux and Thibodeaux are on the road again . . ."Boudreaux, we have to get this shipment of mudbugs to Baton Rouge b 阅读全文
摘要：
Average is not Fast Enough!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 3436 Accepted Submission(s): 1348 Problem DescriptionA relay is a race for two or more teams of runners. Each member of a team runs one section of the race. Your task is t 阅读全文
摘要：
Design T-ShirtTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 4372 Accepted Submission(s): 2126 Problem DescriptionSoon after he decided to design a T-shirt for our Algorithm Board on Free-City BBS, XKA found that he was trapped by all kinds of s 阅读全文
摘要：
Least Common MultipleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 24649 Accepted Submission(s): 9281 Problem DescriptionThe least common multiple (LCM) of a set of positive integers is the smallest positive integer which is divisible by all th 阅读全文
摘要：
A Mathematical Curiosityhttp://acm.hdu.edu.cn/showproblem.php?pid=1017Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 22366 Accepted Submission(s): 7021 Problem DescriptionGiven two integers n and m, count the number of pairs of integers (a,b) su 阅读全文
摘要：
FatMouse' Tradehttp://acm.hdu.edu.cn/showproblem.php?pid=1009Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 35250 Accepted Submission(s): 11553 Problem DescriptionFatMouse prepared M pounds of cat food, ready to trade with the cats guarding 阅读全文
摘要：
To and FroTime Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 52 Accepted Submission(s) : 33Font: Times New Roman | Verdana | GeorgiaFont Size: ← →Problem Description Mo and Larry have devised a way of encrypting messages. They first decide secretly on 阅读全文
摘要：
大菲波数Time Limit : 1000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 95 Accepted Submission(s) : 39Font: Times New Roman | Verdana | GeorgiaFont Size: ← →Problem DescriptionFibonacci数列，定义如下： f(1)=f(2)=1 f(n)=f(n-1)+f(n-2) n>=3。 计算第n项Fibonacci数值。Input输入第一行为一个整数N， 阅读全文
摘要：
The 3n + 1 problemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 18442 Accepted Submission(s): 6815 Problem DescriptionProblems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive 阅读全文