随笔分类 -  数学-高精度

摘要:题目连接http://acm.hdu.edu.cn/showproblem.php?pid=1316How Many Fibs?DescriptionRecall the definition of the Fibonacci numbers: $f_1 := 1$ $f_2 := 2$ $f_n ... 阅读全文
posted @ 2015-06-15 22:00 GadyPu 阅读(158) 评论(0) 推荐(0)
摘要:题目连接http://acm.hdu.edu.cn/showproblem.php?pid=1715大菲波数Description$Fibonacci$数列,定义如下:$f(1)=f(2)=1$$f(n)=f(n-1)+f(n-2) \ \ 3 \leq n$。计算第$n$项$Fibonacci$数... 阅读全文
posted @ 2015-06-15 21:49 GadyPu 阅读(227) 评论(0) 推荐(0)
摘要:题目连接http://acm.hdu.edu.cn/showproblem.php?pid=1212Train Problem IIDescriptionAs we all know the Train Problem I, the boss of the Ignatius Train Statio... 阅读全文
posted @ 2015-06-15 19:12 GadyPu 阅读(129) 评论(0) 推荐(0)
摘要:题目连接http://acm.hdu.edu.cn/showproblem.php?pid=1212Big NumberDescriptionAs we know, Big Number is always troublesome. But it's really important in our ... 阅读全文
posted @ 2015-06-14 17:36 GadyPu 阅读(121) 评论(0) 推荐(0)
摘要:题目连接http://acm.hdu.edu.cn/showproblem.php?pid=1250Hat's FibonacciDescriptionA Fibonacci sequence is calculated by adding the previous two members the ... 阅读全文
posted @ 2015-06-14 10:58 GadyPu 阅读(175) 评论(0) 推荐(0)
摘要:题目连接http://acm.hdu.edu.cn/showproblem.php?pid=1047Integer InquiryDescriptionOne of the first users of BIT's new supercomputer was Chip Diller. He exte... 阅读全文
posted @ 2015-05-31 15:18 GadyPu 阅读(184) 评论(0) 推荐(0)
摘要:题目连接http://acm.hdu.edu.cn/showproblem.php?pid=1042N!DescriptionGiven an integer N(0 ≤ N ≤ 10000), your task is to calculate N!InputOne N in one line, ... 阅读全文
posted @ 2015-05-31 15:07 GadyPu 阅读(170) 评论(0) 推荐(0)
摘要:题目连接http://acm.hdu.edu.cn/showproblem.php?pid=1002A + B Problem IIDescriptionI have a very simple problem for you. Given two integers A and B, your jo... 阅读全文
posted @ 2015-05-31 14:37 GadyPu 阅读(135) 评论(0) 推荐(0)
摘要:自己写的大数模板,参考了小白书上的写法,只是实现了加减乘法,不支持负数,浮点数。。除法还没写o(╯□╰)o以后再慢慢更吧。。其实除法我用(xie)的(bu)少(lai),乘法写过fft,这模板还是很鸡肋的。。 1 #include 2 #include 3 #include 4 #inclu... 阅读全文
posted @ 2015-05-31 14:30 GadyPu 阅读(200) 评论(0) 推荐(0)