杭电1021--Fibonacci Again

Fibonacci Again

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

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
 

 

 

Author

Leojay

// 7 11 18 29 47 76 123..........模3取余后为1 2 0 2 2 1 0..... ， 多写几组会发现 只要满足n%4==2; F[n]就会被3整除；

#include<stdio.h>
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        if(n%4==2)
        printf("yes\n");
        else
        printf("no\n");
    }
    return 0;
}