高精度
猪猪奋斗记
这个作者很懒,什么都没留下…
展开
-
NEFU592求斐波那契数列
斐波那契Time Limit 1000msMemory Limit 65536Kdescriptionf[0]=1,f[1]=1,f[n]=f[n-1]+f[n-2],求f[n]。好熟悉的题目啊,可惜变成高精度了。 input输入原创 2014-03-09 15:25:12 · 677 阅读 · 0 评论 -
hdu1250高精度
Hat's FibonacciTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7243 Accepted Submission(s): 2366Problem DescriptionA Fibonacc原创 2014-07-21 15:47:59 · 703 阅读 · 0 评论 -
hdu1316(How Many Fibs?)高精度
Problem DescriptionRecall the definition of the Fibonacci numbers: f1 := 1 f2 := 2 fn := fn-1 + fn-2 (n >= 3) Given two numbers a and b, calculate how many Fibonacci numbers are in the r原创 2014-07-21 17:26:03 · 742 阅读 · 0 评论 -
HDU2506 Tiling (高精度+递推)
DescriptionIn how many ways can you tile a 2xn rectangle by 2x1 or 2x2 tiles? Here is a sample tiling of a 2x17 rectangle. InputInput is a sequence of lines, each line co原创 2014-07-27 11:45:11 · 1030 阅读 · 0 评论 -
大数模板(HDU4927)
#include #include #include #include #include using namespace std; #define MAXN 9999#define MAXSIZE 10#define DLEN 4class BigInt{ private: int a[500]; //可以控制大数的位数 int len;转载 2014-08-07 20:24:47 · 694 阅读 · 0 评论