HDU 1021 Fibonacci Again 水题 优化

Fibonacci Again

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

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

 

Recommend

JGShining   |   We have carefully selected several similar problems for you:   1061  1108  1071  1049  1170 

 

水题，但是得优化一下，题目上要求对三取模，然后我们对每一个都取模，不然long long 都会超出，

ac代码：

#include <stdio.h>

long long f[1000005]={1,2};

int main()
{
	long long i,n;
	
	for(i=2;i<1000005;i++)
	{
		f[i]=(f[i-1]+f[i-2])%3;
	}
	while(~scanf("%I64d",&n))
	{
		if(!f[n])
			printf("yes\n");
		else
			printf("no\n");
	}
	
	return 0;
}