kuangbin - 博客园

A hard puzzle ACM HDU1097

摘要： A hard puzzleTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13437Accepted Submission(s): 4677Problem Descriptionlcy gives a hard puzzle to feng5166,lwg,JGShining and Ignatius: gave a and b,how to know the a^b.everybody objects to this BT problem,s 阅读全文

posted @ 2011-08-01 10:23 kuangbin 阅读(1606) 评论(4) 推荐(0)

Humble Numbers HDU 1058 ACM

摘要： Humble NumbersTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6085Accepted Submission(s): 2639Problem DescriptionA number whose only prime factors are 2,3,5 or 7 is called a humble number. The sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 16, 阅读全文

posted @ 2011-07-31 21:43 kuangbin 阅读(3230) 评论(1) 推荐(2)

Rightmost Digit ACM HDU1061

摘要： Rightmost DigitTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12357Accepted Submission(s): 4773Problem DescriptionGiven a positive integer N, you should output the most right digit of N^N.InputThe input contains several test cases. The first line 阅读全文

posted @ 2011-07-31 20:50 kuangbin 阅读(3179) 评论(0) 推荐(1)

HangOver ACM HDU1056

摘要： #include<iostream>using namespace std;int main(){ int n; double sum; double len; while(cin>>len) { if(len==0)break; sum=0; n=0; while(sum<len) { n++; sum+=1.0/(n+1); } cout<<n<<" card(s)"<<endl; } return 0; } HangOverTime Limit: 2000/1000 MS (Java/Others)Me 阅读全文

posted @ 2011-07-31 19:52 kuangbin 阅读(970) 评论(0) 推荐(0)

ACM HDU 1048The Hardest Problem Ever

摘要： The Hardest Problem EverTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7298Accepted Submission(s): 3289Problem DescriptionJulius Caesar lived in a time of danger and intrigue. The hardest situation Caesar ever faced was keeping himself alive. In o 阅读全文

posted @ 2011-07-31 19:45 kuangbin 阅读(3530) 评论(0) 推荐(0)

ACM POJ 1037 Keep on Truckin'

摘要： Keep on Truckin'Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3435Accepted Submission(s): 2369Problem DescriptionBoudreaux and Thibodeaux are on the road again . . ."Boudreaux, we have to get this shipment of mudbugs to Baton Rouge by to 阅读全文

posted @ 2011-07-31 00:38 kuangbin 阅读(1135) 评论(0) 推荐(0)

ACM HDU 1032The 3n + 1 problem

摘要： The 3n + 1 problemTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8757Accepted Submission(s): 3196Problem DescriptionProblems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In 阅读全文

posted @ 2011-07-30 22:09 kuangbin 阅读(1024) 评论(0) 推荐(0)

ACM HDU 1029Ignatius and the Princess IV

摘要： Ignatius and the Princess IVTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32767 K (Java/Others)Total Submission(s): 6518Accepted Submission(s): 2325Problem Description"OK, you are not too bad, em... But you can never pass the next test." feng5166 says."I will tell you an o 阅读全文

posted @ 2011-07-30 21:40 kuangbin 阅读(3741) 评论(4) 推荐(2)

ACM HDU 1028Ignatius and the Princess III

摘要： Ignatius and the Princess IIITime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4680Accepted Submission(s): 3280Problem Description"Well, it seems the first problem is too easy. I will let you know how foolish you are later." feng5166 says.& 阅读全文

posted @ 2011-07-30 21:02 kuangbin 阅读(2398) 评论(0) 推荐(0)

ACM HDU 1021Fibonacci Again

摘要： Fibonacci AgainTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15017Accepted Submission(s): 7022Problem 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 sequence 阅读全文

posted @ 2011-07-30 20:25 kuangbin 阅读(432) 评论(0) 推荐(0)