HDU - 随笔分类(第2页) - 三人木君

[解题报告]HDU 1092 A+B for Input-Output Practice (IV)

摘要：A+B for Input-Output Practice (IV)Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 46866Accepted Submission(s): 24976Problem DescriptionYour task is to Calculate the sum of some integers.InputInput contains multiple test cases. Each test case contai 阅读全文

posted @ 2013-03-26 19:24 三人木君阅读(197) 评论(0) 推荐(0)

[解题报告]HDU 1091 A+B for Input-Output Practice (III)

摘要：A+B for Input-Output Practice (III)Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 52807Accepted Submission(s): 26976Problem DescriptionYour task is to Calculate a + b.InputInput contains multiple test cases. Each test case contains a pair of integ 阅读全文

posted @ 2013-03-25 19:40 三人木君阅读(321) 评论(0) 推荐(0)

[解题报告]HDU 1090 A+B for Input-Output Practice (II)

摘要：A+B for Input-Output Practice (II)Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 44060Accepted Submission(s): 29117Problem DescriptionYour task is to Calculate a + b.InputInput contains an integer N in the first line, and then N lines follow. Each 阅读全文

posted @ 2013-03-20 19:24 三人木君阅读(213) 评论(0) 推荐(0)

[解题报告]HDU 1089 A+B for Input-Output Practice (I)

摘要：A+B for Input-Output Practice (I)Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 58296Accepted Submission(s): 32536Problem DescriptionYour task is to Calculate a + b.Too easy?! Of course! I specially designed the problem for acm beginners.You must 阅读全文

posted @ 2013-03-20 19:23 三人木君阅读(195) 评论(0) 推荐(0)

[解题报告]HDU 1076 An Easy Task

摘要：An Easy TaskTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10602Accepted Submission(s): 6631Problem DescriptionIgnatius was born in a leap year, so he want to know when he could hold his birthday party. Can you tell him?Given a positive integers Y 阅读全文

posted @ 2013-03-19 21:00 三人木君阅读(185) 评论(0) 推荐(0)

[解题报告]HDU 1049 Climbing Worm

摘要：Climbing WormTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9062Accepted Submission(s): 5908Problem 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 minut 阅读全文

posted @ 2013-03-18 22:01 三人木君阅读(199) 评论(0) 推荐(0)

[解题报告]HDU 1020 Encoding

摘要：EncodingTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 19071Accepted Submission(s): 8230Problem DescriptionGiven a string containing only 'A' - 'Z', we could encode it using the following method:1. Each sub-string containing k same 阅读全文

posted @ 2013-03-18 21:00 三人木君阅读(304) 评论(0) 推荐(0)

[解题报告]HDU 1013 Digital Roots

摘要：Digital RootsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 35288Accepted Submission(s): 10794Problem 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-03-14 21:01 三人木君阅读(3766) 评论(1) 推荐(2)

[解题报告]HDU 1012 u Calculate e

摘要：u Calculate eTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 21753Accepted Submission(s): 9604Problem DescriptionA simple mathematical formula for e iswhere n is allowed to go to infinity. This can actually yield very accurate approximations of e u 阅读全文

posted @ 2013-03-13 21:46 三人木君阅读(169) 评论(0) 推荐(0)

[解题报告]HDU 1008 Elevator

摘要：ElevatorTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 30095Accepted Submission(s): 16272Problem DescriptionThe highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers denote at which floo 阅读全文

posted @ 2013-03-13 21:25 三人木君阅读(4109) 评论(0) 推荐(0)

[解题报告]HDU 1005 Number Sequence

摘要：Number SequenceTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 73223Accepted Submission(s): 17033Problem 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 are to 阅读全文

posted @ 2013-03-13 20:43 三人木君阅读(332) 评论(0) 推荐(0)

[解题报告]HDU 1004 Let the Balloon Rise

摘要：Let the Balloon RiseTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 50554Accepted Submission(s): 18117Problem DescriptionContest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges' favorite time 阅读全文

posted @ 2013-03-12 20:14 三人木君阅读(5418) 评论(0) 推荐(2)

三人木君

随笔分类 - HDU

公告