1198 : Fibonacci Cane
Time Limit: 1 Sec Memory Limit: 128 MB Submitted: 889 Solved: 446Description
Bob likes Fibonacci numbers too much. When he buys sugar canes, he hopes that the length of the sugar cane is a continuous sum of Fibonacci sequence.
Fibonacci sequence is a sequence that: f0 = 1, f1 = 1, …, fn = fn − 1 + fn − 2.
He asks you to help determine whether a sugar cane is what he wants.
Input
No more than 1000 test cases. Each case contains a
positive integer n, the length of a sugar cane.
1 ≤ n ≤ 1015
Output
Output YES if the length is a continuous sum of the
Fibonacci sequence, otherwise output NO.
Sample
1 2 5 9 10
YES YES YES NO YES
Hint
Author
CSGrandeur