hdu021Fibonacci Again

Fibonacci Again

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

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>
#include<math.h>
int main()
{
	int n,i,a,b;
	int sum;
	while(scanf("%d",&n)!=EOF)
	{
		a=7;
		b=11;
		for(i=2;i<=n;i++)
		{
			sum=(a%3+b%3)%3;
			a=b%3;
			b=sum%3;
		}
		if(sum==0)
		printf("yes\n");
		else printf("no\n");
	}
	return 0;
}
/**求模公式：
           （1） (a + b) % p = (a % p + b % p) % p 
         （2） (a - b) % p = (a % p - b % p) % p 
         （3） (a * b) % p = (a % p * b % p) % p 
         （4）  a ^ b % p = ((a % p)^b) % p 
*/

   
   
n的范围是n<1000000直接求肯定不行