CDZSC_2015寒假新人（2）——数学 D

D - D

Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

Submit Status

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>
#include<cstdio>
#include<cmath>
#include<ctime>
using namespace std;
int a[1000010];
int main()
{
    a[0]=7;
    a[1]=11;
    for(int i=2;i<1000000;i++)
    {
        a[i]=(a[i-1]+a[i-2])%3;
    }
    int n;
    //printf("%.2f",(double)clock()/CLOCKS_PER_SEC);
    while((scanf("%d",&n))!=EOF)
    {
        if(a[n]%3==0)
        {
        printf("yes\n");
        }
        else
        {
            printf("no\n");
        }
    }
}