Fibonacci Again

题目描述

There are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n>=2).

输入

Input consists of a sequence of lines, each containing an integer n. (n < 1,000,000).

输出

Print the word "yes" if 3 divide evenly into F(n). Print the word "no" if not.

示例输入

0
1
2
3
4
5

示例输出

no
no
yes
no
no
no

  
  
#include <stdio.h>  
int main()  
{  
    long long int f[100000]={7,11};  
    int i,n;  
    while(scanf("%d",&n)!=EOF)  
    {  
  
        for(i=2;i<=n;i++)  
        {  
        f[i]=f[i-1]+f[i-2];  
        }  
        if(f[n]%3==0) printf("yes\n");  
        else printf("no\n");  
    }  
    return 0;  
  
  
}