Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

用尾数是0或者是1来讨论更好理解

Posted by Eov_Second at 2017-02-16 11:19:11 on Problem 1953
In Reply To:对于是斐波那契的证明 Posted by:lx865712528 at 2013-08-21 20:26:01
由i-1位扩充到i位以后,如果这个数尾数是0,那么前面i-1个数怎么排列都行,就是f(i-1)种情况
如果尾数是1,那么倒数第二位必然是0,然后剩下的i-2个数随意排列,所以是f(i-2)种可能
根据加法原理f(i)=f(i-1)+f(i-2)

Followed by:

Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top


All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator