数学
文章平均质量分 82
心随梦动
这个作者很懒,什么都没留下…
展开
-
fibonacci数列(二) nylg148
fibonacci数列(二)时间限制:1000 ms | 内存限制:65535 KB难度:3描述 In the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn − 1 + Fn − 2 for n ≥ 2. For example, the first ten terms of the Fibona原创 2013-06-02 20:01:54 · 771 阅读 · 0 评论 -
M斐波那契数列 hdu 4549
M斐波那契数列Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 520 Accepted Submission(s): 146Problem DescriptionM斐波那契数列F[n]是一种整数数列,它的定原创 2013-06-02 21:48:17 · 711 阅读 · 0 评论 -
Fibonacci Numbers-hdu3117
Fibonacci NumbersTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1285 Accepted Submission(s): 543Problem DescriptionThe Fibonac原创 2013-06-04 20:59:22 · 749 阅读 · 0 评论 -
Tr A hdu1575
Tr ATime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1781 Accepted Submission(s): 1311Problem DescriptionA为一个方阵,则Tr A表示A的迹(就是主对角线上各项原创 2013-06-04 21:58:53 · 766 阅读 · 0 评论 -
A Short problem HDU4291
思路:由于要求g(g(g(n))) mod 109 + 7可以先求出g(g(n))假设g(g(n)) = M根据测试程序可以知道M是循环的(循环节是222222224)要求g(g(n))可以先求出g(n)假设g(n)=N;根据测试程序可以知道N是循环的(循环节是183120)//求循环节:package hpu;//222222224 183120p原创 2013-06-05 21:20:34 · 719 阅读 · 0 评论 -
HDU2276 Kiki & Little Kiki 2
Kiki & Little Kiki 2Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1377 Accepted Submission(s): 727Problem DescriptionThere are原创 2013-06-07 22:11:16 · 761 阅读 · 0 评论