Project Euler Problem 25
摘要：
The Fibonacci sequence is defined by the recurrence relation:Fn= Fn1+ Fn2, where F1= 1 and F2= 1.Hence the first 12 terms will be:F1= 1F2= 1F3= 2F4= 3F5= 5F6= 8F7= 13F8= 21F9= 34F10= 55F11= 89F12= 144The 12th term, F12, is the first term to contain three digits.What is the first term in the Fibonacc 阅读全文
posted @ 2011-03-21 21:45 Ray Z 阅读(239) 评论(0) 推荐(0) 编辑
