#HDU1250

HDU1250:Hat's Fibonacci

ProblemDescriptionAFibonaccisequenceiscalculatedbyaddingtheprevioustwomembersthesequence,withthefirsttwomembersbeingboth1.F(1)=1,F(2)=1,F(3)=1,F(4)=1,F(n>4)=...
代码星球 ·2020-08-09