hdu 1021 Fibonacci Again

Fibonacci Again

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

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

012345

 

Sample Output

nonoyesnonono

 

Author

Leojay

 

Recommend

JGShining   |   We have carefully selected several similar problems for you:  1049 1032 1013 1170 1425 

 

 

  。。打表找规律。

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