Fibonacci Again

Fibonacci Again

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

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

emmmm...数学题. 用递归暴力会runtime error 其实也心知肚明.. 基本上.. 这么大的数据要巧♂取...

然后列举了f1~10 发现对三取余可能有周期性 周期是8 于是就先把n对8取余 再递归

#include<stdio.h>
int F(int n)
{
	if(n==0)
		return 7;
	if(n==1)
		return 11;
	return F(n-1)+F(n-2);
}

int main()
{
	int n;
	while(~scanf("%d",&n))
	{
		n%=8;
		if(F(n)%3==0)
			printf("yes\n");
		else
			printf("no\n");
	}
	return 0;
}