HDU 1021

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

#include<iostream>using namespace std;const int N = 1000+ 24;int f[N];int main(){    int n,t;    while (cin >> n)    {        f[0] = 7, f[1] = 11;        if (n == 0)     cout << "no" << endl;        if (n == 1)    cout << "no" << endl;        if (n >= 2)        {            for (int i = 2; i < n; i++)            {                f[n] = f[n - 1] + f[n - 2];                t = f[n];            }            if (f[n] % 3 == 0)                cout << "yes" << endl;            else                cout << "no" << endl;        }    }    return 0;}