关闭

HDU 4794 Arnold (Fib数模 n 的应用)——2013 Asia Changsha Regional Contest

传送门 ArnoldTime Limit: 20000/10000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 391    Accepted Submission(s): 100Problem Description Do you know Vladimir Arnold? H...
阅读(1248) 评论(0)

hdu 4549 M斐波那契数列

click here ~~Problem Description M斐波那契数列F[n]是一种整数数列,它的定义如下:F[0] = a F[1] = b F[n] = F[n-1] * F[n-2] ( n > 1 )现在给出a, b, n,你能求出F[n]的值吗? Input 输入包含多组测试数据; 每组数据占一行,包含3个整数a, b, n( 0 <= a, b, n <= 10^9 ) Out...
阅读(535) 评论(0)

hdu 3509 Buge's Fibonacci Number Problem

点击此处即可传送 hdu 3509题目大意:F1 = f1, F2 = f2;; F(n) = a*F(n-1) + b*F(n-2); S(n) = F1^k + F2^k +….+Fn^k; 求S(n) mod m; 解题思路: 1:首先一个难题就是怎么判断矩阵的维数(矩阵的维数是个变量) 解决方法:开一个比较大的数组,然后再用一个公有变量记一下就行了,具体详见代码; 2:k次方,...
阅读(563) 评论(0)

hdu 2814 Interesting Fibonacci

点击此处即可传送 hdu 2814 题目大意:就是给你两个函数,一个是F(n) = F(n-1) + F(n-2), F(0) = 0, F(1) = 1; 另一个是 G(n) = G(n-1)^F(a^b); G(1) = F(a^b); 求G(n) % c; 范围:A, B, N, C (10<=A, B<2^64, 2<=N<2^64, 1<=C<=300)注意了:c的范围是1<...
阅读(526) 评论(0)

hdu 1757 A Simple Math Problem

点击此处即可传送到hdu 1757 **A Simple Math Problem** Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3497 Accepted Submission(s...
阅读(428) 评论(0)

hdu 1588 Gauss Fibonacci

点击此处即可传送hdu 1588 **Gauss Fibonacci** Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2849 Accepted Submission(s): 1...
阅读(400) 评论(0)

hdu 3306 Another kind of Fibonacci

点击此处即可传送hdu 3306 **Another kind of Fibonacci** Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 2005 Accepted Submi...
阅读(561) 评论(0)

HIT 2060 Fibonacci Problem Again

点击此处即可传送HIT 2060As we know , the Fibonacci numbers are defined as follows: F(n) == {1 n==0||n==1 {F(n-1)+F(n-2) n>1; Given two numbers a and b , calculate . 从a到b之间的斐波那契数的和Input The input con...
阅读(480) 评论(0)

hdu 3117 Fibonacci Numbers

点击此处即可传送到hdu 3117 **Fibonacci Numbers** Problem DescriptionThe Fibonacci sequence is the sequence of numbers such that every element is equal to the sum of the two previous elements, e...
阅读(456) 评论(0)

hdu 1250 Hat's Fibonacci

点击此处即可传送hdu 1250Problem DescriptionA Fibonacci sequence is calculated by adding the previous two members the sequence, with the first two members being both 1. F(1) = 1, F(2) = 1, F(3) = 1,F(4) = 1, F(...
阅读(559) 评论(0)

hdu 1568 Fibonacci

点击此处即可传送hdu 1568 **Fibonacci** Problem Description2007年到来了。经过2006年一年的修炼,数学神童zouyu终于把0到100000000的Fibonacci数列 (f[0]=0,f[1]=1;f[i] = f[i-1]+f[i-2](i>=2))的值全部给背了下来。 接下来,CodeSt...
阅读(492) 评论(0)
    个人资料
    • 访问:449691次
    • 积分:10708
    • 等级:
    • 排名:第1618名
    • 原创:633篇
    • 转载:5篇
    • 译文:0篇
    • 评论:89条
    博客专栏