摘要：
SZ 斐波拉契数列 Time Limit : 3000/1000ms (Java/Other)Memory Limit : 65535/32768K (Java/Other)Total Submission(s) : 8Accepted Submission(s) : 6Font: Times New Roman | Verdana | Georgia Font Size: ← →Problem Description你应该很熟悉斐波拉契数列，对吗？下面是SZ斐波拉契数列：n=1 F(n)=an=2 F(n)=bn>2 and n is odd F(n)=F(n-1)+F(n-2)n&g 阅读全文