HDU 1201 Fibonacci Again

Fibonacci Again Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 65   Accepted Submission(s) : 18 Font: Times New Roman | Verdana | Georgia Font Size: ← → 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 Author Leojay 代码： #include<stdio.h> int main() {     long n;   while(scanf("%ld",&n)!=EOF)   {    if((n-2)%4)         printf("no\n");        else printf("yes\n");   }     return 0; }