随笔分类 -  HDUOJ

上一页 1 2 3 4 下一页
hdu_1060_Leftmost Digit_201311071827-2
摘要：Leftmost DigitTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 11305 Accepted Submission(s): 4329 Problem DescriptionGiven a positive integer N, you should output the leftmost digit of N^N.InputThe input contains several test cases. The first line 阅读全文
posted @ 2013-11-07 18:44 龙腾四海365 阅读(110) 评论(0) 推荐(0)
hdu_1056_HangOver_201311071354
摘要：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 阅读全文
posted @ 2013-11-07 14:05 龙腾四海365 阅读(134) 评论(0) 推荐(0)
hdu_1049_Climbing Worm_201311061331
摘要：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 阅读全文
posted @ 2013-11-06 13:47 龙腾四海365 阅读(147) 评论(0) 推荐(0)
hdu_1048_The Hardest Problem Ever_201311052052
摘要：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. 阅读全文
posted @ 2013-11-05 21:21 龙腾四海365 阅读(260) 评论(0) 推荐(0)
hdu_1041_Computer Transformation_201311051648
摘要：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 阅读全文
posted @ 2013-11-05 17:37 龙腾四海365 阅读(187) 评论(0) 推荐(0)
hdu_1039_Easier Done Than Said_201311051511
摘要：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 阅读全文
posted @ 2013-11-05 15:53 龙腾四海365 阅读(171) 评论(0) 推荐(0)
hdu_1038_Biker's Trip Odometer_201311021643
摘要：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 阅读全文
posted @ 2013-11-02 16:49 龙腾四海365 阅读(230) 评论(0) 推荐(0)
hdu_1037_Keep on Truckin'_201311021600
摘要：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 阅读全文
posted @ 2013-11-02 16:08 龙腾四海365 阅读(132) 评论(0) 推荐(0)
hdu_1036_Average is not Fast Enough_201311021335
摘要：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 阅读全文
posted @ 2013-11-02 15:29 龙腾四海365 阅读(180) 评论(0) 推荐(0)
hdu_1031_Design T-Shirt_201310291647
摘要：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 阅读全文
posted @ 2013-10-29 17:48 龙腾四海365 阅读(171) 评论(0) 推荐(0)
hdu_1019_Least Common Multiple_201310290920
摘要：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 阅读全文
posted @ 2013-10-29 09:42 龙腾四海365 阅读(240) 评论(0) 推荐(0)
hdu_1017_A Mathematical Curiosity_201310280948
摘要：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 阅读全文
posted @ 2013-10-28 10:35 龙腾四海365 阅读(152) 评论(0) 推荐(0)
hdu_1009_FatMouse' Trade_201310280910
摘要：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 阅读全文
posted @ 2013-10-28 09:40 龙腾四海365 阅读(132) 评论(0) 推荐(0)
The 3n + 1 problem
摘要：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 阅读全文
posted @ 2013-10-25 23:54 龙腾四海365 阅读(177) 评论(0) 推荐(0)
hdu_1021_Fibonacci Again_201310232237
摘要：Fibonacci AgainTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 30227 Accepted Submission(s): 14685 Problem DescriptionThere are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n>=2).InputInput consists of a sequ 阅读全文
posted @ 2013-10-23 22:53 龙腾四海365 阅读(109) 评论(0) 推荐(0)
hdu_1005_Number Sequence_201310222120
摘要：Number SequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 86547 Accepted Submission(s): 20560 Problem DescriptionA number sequence is defined as follows:f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.Given A, B, and n, you .. 阅读全文
posted @ 2013-10-22 22:57 龙腾四海365 阅读(144) 评论(0) 推荐(0)
hdu_1029-Ignatius and the Princess IV_201310180916
摘要：Ignatius and the Princess IVTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32767 K (Java/Others) Total Submission(s): 13419 Accepted Submission(s): 5419 Problem Description"OK, you are not too bad, em... But you can never pass the next test." feng5166 says."I will tell you 阅读全文
posted @ 2013-10-18 10:21 龙腾四海365 阅读(168) 评论(0) 推荐(0)
hdu_1020_Encoding_201310172120
摘要：EncodingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 22110 Accepted Submission(s): 9687 Problem DescriptionGiven a string containing only 'A' - 'Z', we could encode it using the following method: 1. Each sub-string containing k 阅读全文
posted @ 2013-10-17 21:21 龙腾四海365 阅读(160) 评论(0) 推荐(0)
hdu_1014_Uniform Generator_201310141958
摘要：Uniform GeneratorTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 14213 Accepted Submission(s): 5562 Problem DescriptionComputer simulations often require random numbers. One way to generate pseudo-random numbers is via a function of the formseed( 阅读全文
posted @ 2013-10-14 20:23 龙腾四海365 阅读(174) 评论(0) 推荐(0)
hdu_1013_Digital Roots_201310121652
摘要：Digital RootsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 40786Accepted Submission(s): 12584Problem DescriptionThe digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then th 阅读全文
posted @ 2013-10-12 17:22 龙腾四海365 阅读(179) 评论(0) 推荐(0)

上一页 1 2 3 4 下一页