ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1225. Flags

. : : m 3 r L i N : : . How do you know this sequence is fibonucci ???? [4] // Problem 1225. Flags 10 May 2003 13:38
Tell me please.
Sridhar Re: How do you know this sequence is fibonucci ???? [3] // Problem 1225. Flags 25 Jul 2004 17:11
m = f(n) = f(n-1)  + f(n-2)

why f(n-1) :-
put W and [R,...(n-1)] or R and [W,...(n-1)]

why f(n-2) :-
put R,B and [W,..(n-2)] or W,B and [R,...(n-2)]

HTH
**X!@ngY1 Re: How do you know this sequence is fibonucci ???? [1] // Problem 1225. Flags 25 Nov 2005 19:20
How supernatural it is~~ ^_^ !

哇靠~~这么科幻~~~
哥们你真逗
Looking Good!
That's it!
Why I got stuck!