10 2010 档案

POB 算法 递归之 Fibonacci数列
摘要：#COMPILE EXE #DIM ALL FUNCTION Fib(BYVAL n AS LONG)AS LONG IF n1 THEN FUNCTION = Fib(n-1)+ Fib(n-2) END IF END FUNCTION FUNCTION PBMAIN () AS LONG DIM rtn AS LONG rtn = Fib(... 阅读全文
posted @ 2010-10-28 00:36 mybuilder 阅读(161) 评论(0) 推荐(0) 编辑