hdoj-【1021 Fibonacci Again】

Fibonacci Again

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

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<cstdio>

int main()
{
	int n;
	while(~scanf("%d",&n))
	{
		if(n<=1||(n-1)%4!=1)
			printf("no\n");
		else
			printf("yes\n");  
	} 
	return 0; 
}