water- Fibonacci Again

Fibonacci Again

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

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 <stdio.h>
#define A 1000005
long ch[A];
void tool()
{
    long i,cnt=0;
    ch[0]=7;
    ch[1]=11;
    for(i=2;cnt<1000000;i++)
    {
        ch[i]=((ch[i-1]%3)+ch[i-2]%3)%3;
        cnt++;
    }
}
int main()
{
    tool();
    long int n;
    while(scanf("%ld",&n)!=EOF)
    {
        if(ch[n]==0)
            printf("yes\n");
        else
            printf("no\n");
    }
    return 0;
}

找规律求解：

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