Fibonacci Again hdu1021

 
 

  
  
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

没意思就是找个循环节。。

#include <iostream>

#include<stdio.h>

using namespace std;

int f(int t)

{

    if(t==0)return 7%3;

    if(t==1)return 11%3;

    else return (f(t-1)+f(t-2))%3;

}

int main()

{

    int n;

    while(scanf("%d",&n)!=-1)

    {

        int t;

        t=n%8;

        if(f(t)==0)printf("yes\n");

        else printf("no\n");

    }

    return 0;

}