Fibonacci Again

Fibonacci Again
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 24 Accepted Submission(s) : 13
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

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

这个数列不能用常规方法来做，会超范围，所以就找所有能被3整除的数的下标，发现是一个等差数列，公差d为4，即an=a1+(n-1)*d;则an-a1=(n-1)*4;
即符合条件的n（也就是an）减去a1一定能被4整除，即n-2能被4整除。所以代码就会很简单。