Fibonacci Again

最新推荐文章于 2024-07-25 21:08:56 发布

liyingjie01

最新推荐文章于 2024-07-25 21:08:56 发布

阅读量274

点赞数

分类专栏：杭电题目

本文链接：https://blog.csdn.net/liyingjie01/article/details/51212680

版权

杭电题目专栏收录该内容

29 篇文章 0 订阅

订阅专栏

Fibonacci Again

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

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

Author

Leojay

水题,不解释.

#include <iostream>
#include <cstring>
#include <cmath>
#include <stdio.h>
using namespace std;
int main()
{
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        if(n%4==2)
            cout<<"yes"<<endl;
        else
            cout<<"no"<<endl;
    }
    return 0;
}