摘要:
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, 阅读全文