ACM-大数
文章平均质量分 86
hereIambabe
这个作者很懒,什么都没留下…
展开
-
S - 大菲波数
Fibonacci数列,定义如下: f(1)=f(2)=1 f(n)=f(n-1)+f(n-2) n>=3。 计算第n项Fibonacci数值。 Input 输入第一行为一个整数N,接下来N行为整数Pi(1Output 输出为N行,每行为对应的f(Pi)。 Sample Input 512345Sample Output 11235原创 2017-07-30 19:39:59 · 255 阅读 · 1 评论 -
How Many Fibs? HDU - 1316
How Many Fibs?Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6639 Accepted Submission(s): 2627Problem DescriptionRecall the de原创 2017-08-02 10:30:56 · 713 阅读 · 1 评论 -
M - Big Number HDU - 1018
Big NumberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 38406 Accepted Submission(s): 18599Problem DescriptionIn many applicati原创 2017-08-03 15:52:57 · 154 阅读 · 0 评论 -
N!
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 83308 Accepted Submission(s): 24528Problem DescriptionGiven an integer N(0 ≤ N ≤原创 2017-08-04 09:23:43 · 240 阅读 · 0 评论 -
Exponentiation
ExponentiationTime Limit: 2000/500 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9689 Accepted Submission(s): 2876Problem DescriptionProblems involvi原创 2017-08-07 14:07:36 · 211 阅读 · 0 评论