随笔分类 - HDOJ
摘要:Leftmost DigitTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Problem DescriptionGiven a positive integer N, you should...
阅读全文
摘要:Design T-ShirtTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Problem DescriptionSoon after he decided to design a T-sh...
阅读全文
摘要:Candy Sharing GameTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Problem DescriptionA number of students sit in a circ...
阅读全文
摘要:A + B Problem IIProblem DescriptionI have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B.InputTh...
阅读全文
摘要:Big NumberProblem DescriptionIn many applications very large integers numbers are required. Some of these applications are using keys for secure trans...
阅读全文
摘要:Tian Ji -- The Horse RacingProblem DescriptionHere is a famous story in Chinese history."That was about 2300 years ago. General Tian Ji was a high off...
阅读全文
摘要:http://acm.hdu.edu.cn/showproblem.php?pid=1012分析:就按题目给的公式一步步输出就行了。 1 #include 2 #include 3 #include 4 int main() 5 { 6 double e; 7 printf("n e...
阅读全文
摘要:RobotProblem DescriptionA robot is a mechanical or virtual artificial agent, usually an electro-mechanical machine that is guided by a computer progra...
阅读全文
摘要:Piggy-BankProblem DescriptionBefore ACM can do anything, a budget must be prepared and the necessary financial support obtained. The main income for t...
阅读全文
摘要:Word AmalgamationProblem DescriptionIn millions of newspapers across the United States there is a word game called Jumble. The object of this game is ...
阅读全文
摘要:Keep on Truckin'Problem DescriptionBoudreaux and Thibodeaux are on the road again . . ."Boudreaux, we have to get this shipment of mudbugs to Baton Ro...
阅读全文
摘要:FatMouse' TradeProblem DescriptionFatMouse prepared M pounds of cat food, ready to trade with the cats guarding the warehouse containing his favorite ...
阅读全文
摘要:SafecrackerProblem Description=== Op tech briefing, 2002/11/02 06:42 CST ==="The item is locked in a Klein safe behind a painting in the second-floor ...
阅读全文
摘要:EncodingProblem DescriptionGiven a string containing only 'A' - 'Z', we could encode it using the following method:1. Each sub-string containing k sam...
阅读全文

浙公网安备 33010602011771号