Fibonacci Again
时间: 1ms 内存:64M
描述:
There are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n>=2)
输入:
Input consists of a sequence of lines, each containing an integer n. (n < 1,000,000)
输出:
Print the word "yes" if 3 divide evenly into F(n).
Print the word "no" if not.
示例输入:
0
1
2
3
4
5
示例输出:
no
no
yes
no
no
no
提示:
参考答案:
解锁文章
文章评论