HDU 1021 Fibonacci Again

Fibonacci Again

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

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

题目大意，F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n>=2). 问你F（i）是否是3的倍数

思路:找规律

i 0 1 2 3 4 5 6 7 8 9
F（i）mod3 1 2 3 2 2 1 3 1 1 2

2之后每4个数就可以被3整除

#include<stdio.h>
#include<math.h>
#include<string.h>
#include<stdlib.h>

int main()
{
   long n;
   while(~scanf("%d",&n))
   {
       if((n+2)%4==0)
           printf("yes\n");
       else
           printf("no\n");
   }
   return 0;
}