HDU-Fibonacci Again

Fibonacci Again

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

应该都知道一般的方法会超范围，既然这题最后求能不能对3整除，所以可以在计算中%3；

#include<bits/stdc++.h>
using namespace std;
int f[1000005];
void Fib()
{
    f[0]=7;
    f[1]=11;
    for(int i=2;i<1000002;i++)
    {
        f[i]=f[i-1]+f[i-2];
        if(f[i]%3!=0)
        {
            f[i]=f[i]%3;
        }
    }
}
int main()
{
    int n;
    Fib();
    while(~scanf("%d",&n))
    {
        if(f[n]%3==0)
            printf("yes\n");
        else
            printf("no\n");
    }
    return 0;
}