Problem Description
There are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n>=2).
Input
Input consists of a sequence of lines, each containing an integer n. (n < 1,000,000).
Output
Print the word "yes" if 3 divide evenly into F(n).
Print the word "no" if not.
Print the word "no" if not.
Sample Input
0 1 2 3 4 5
Sample Output
no no yes no no no
这是一道很唬人的题目,如果你没仔细观察而直接循环出F(N)的结果然后来判断的话,答案是绝对错误的,因为虽然题目所给的N的范围不大,才1000000,但是经过这个数列的循环,就算用long long int也无法储存,除非你高精度运算。
当然你仔细观察在草稿纸上算一算或者写个程序列一下就能轻易发现规律,除了开头的F(2),剩下的每4个F(N)出现一次可以被3整除的数。因此程序可以很简单。