Fibonacci Again

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

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

Sample Output

yes

Author

Leojay

 #include <stdio.h>

 int main()

 {

     int f[];

     int n;

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

     {

         int i,xh;

         f[]=%;

         f[]=%;

         for(i=;i<;i++)

         {

             f[i]=(f[i-]+f[i-])%;

             if(f[i]==&&f[i-]==)

             break;

         }

         xh=i-;

         n=n%xh;

         if(f[n]==)

         printf("yes\n");

         else

         printf("no\n");

     }

     return ;

 }

思路详见hdu_1005 这两题类似

巴特西

hdu_1021_Fibonacci Again_201310232237

Fibonacci Again

最新文章

热门文章