首页 > 其他 > 详细

HDU-1021 Fibonacci Again

时间:2017-04-12 22:58:18      阅读:174      评论:0      收藏:0      [点我收藏+]

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-1005 类似。

#include <iostream>
using namespace std;

int main(void)
{
    int n;
    
    while(cin >> n)
    {
        
        if(n%4 == 2)
            cout << "yes" << endl;
        else
            cout << "no" << endl;
    }
    
    return 0;
}

 

HDU-1021 Fibonacci Again

原文:http://www.cnblogs.com/limyel/p/6701783.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!