![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
大数
贾作真时真亦贾
吾日三省吾身
展开
-
HDU 1250 Hat's Fibonacci
Problem 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(n>4) = F(n - 1)原创 2017-05-23 21:45:27 · 211 阅读 · 0 评论 -
HDU 1042 N!
Problem DescriptionGiven an integer N(0 ≤ N ≤ 10000), your task is to calculate N!InputOne N in one line, process to the end of file.OutputFor each N, output N! in one line.Sample Input1 2 3Sample Ou原创 2017-05-14 19:46:15 · 248 阅读 · 0 评论