hdu 1021 Fibonacci Again 找规律

Posted 行尸走肉

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了hdu 1021 Fibonacci Again 找规律相关的知识,希望对你有一定的参考价值。

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

 

以上是关于hdu 1021 Fibonacci Again 找规律的主要内容,如果未能解决你的问题,请参考以下文章

hdu-1021 Fibonacci Again

HDU 1021[Fibonacci Again]规律

hdu 1021 Fibonacci Again 找规律

快速幂 HDU-1021 Fibonacci Again , HDU-1061 Rightmost Digit , HDU-2674 N!Again

hdu 1021 Fibonacci Again(变形的斐波那契)

杭电1021Fibonacci Again