hdoj.1021 Fibonacci Again 20140725

Fibonacci Again

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

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>
int p[1000010];
int main()
{
    int n,i;
    p[0]=1;p[1]=2;
    for(i=2;i<1000000;i++)  p[i]=(p[i-1]+p[i-2])%3;
    while(scanf("%d",&n)!=EOF){
        if(!p[n]) printf("yes\n");
        else printf("no\n");
    }
    return 0;
}