hdu 1021 Fibonacci Again 找规律

时间：2016-06-03 17:26:26 阅读：115 评论：0 收藏：0 [点我收藏+]

标签：

Fibonacci Again

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 51448 Accepted Submission(s): 24346

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.

Sample Input

0 1 2 3 4 5

Sample Output

no no yes no no no

标签：

原文地址：http://www.cnblogs.com/superxuezhazha/p/5556914.html

踩

(0)

评论一句话评论（0）

分享档案

更多>

周排行