HDOJ 1021 Fibonacci Again

Fibonacci Again

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

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
  
  
  
  

   
   这个题目类似于找规律的题目 计算可知f[0]=7 f[1]=11  f[2]=18  f[3]=29 f[4]=47  f[5]=76  f[6]=123 f[7]=199  f[8]=322    f[9]=521  而对于f[n]%3这个  g[0]=1  g[1]=2  g[2]=0  g[3]=2  g[4]=2  g[5]=1  g[6]=0  g[7]=1  g[8]=1 g[9]=2 g[10]=0
  
  
  
  

   
   所以AC代码如下
  
  
  
  

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