hdu 1021 Fibonacci Again

最新推荐文章于 2023-03-20 11:18:28 发布

_txg

最新推荐文章于 2023-03-20 11:18:28 发布

阅读量268

点赞数

分类专栏： # ACM-算法设计

本文链接：https://blog.csdn.net/txgang/article/details/51720207

版权

ACM-算法设计专栏收录该内容

101 篇文章 0 订阅

订阅专栏

题目链接：点击打开链接

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

Sample Output

  
  
   
   no
no
yes
no
no
no

///ps:由于数据太大，不可以直接对3取余，打表找规律会发现只有（n-2）%4==0时是yes
#include <iostream>

using namespace std;

int main()
{
    long long n;
    while(cin>>n)
    {
       if(n==0||n==1)
       {
           cout<<"no\n";
           continue;
       }

        if((n-2)%4==0)cout<<"yes\n";
        else cout<<"no\n";
    }
    return 0;
}