hdu 5018

Problem Description

In mathematical terms, the sequence Fn of Fibonacci numbers is defined by the recurrence relation
F _n = F _n-1 + F _n-2
with seed values F ₁ = 1; F ₂ = 1 (sequence A000045 in OEIS).
---Wikipedia

Today, Fibonacci takes revenge on you. Now the first two elements of Fibonacci sequence has been redefined as A and B. You have to check if C is in the new Fibonacci sequence.

 

Input

The first line contains a single integer T, indicating the number of test cases. 

Each test case only contains three integers A, B and C.

[Technical Specification]
1. 1 <= T <= 100
2. 1 <= A, B, C <= 1 000 000 000

 

Output

For each test case, output “Yes” if C is in the new Fibonacci sequence, otherwise “No”.

 

Sample Input

  
  

   
   3
2 3 5
2 3 6
2 2 110
  
  

 

Sample Output

  
  

   
   Yes
No
Yes

   
   

    
    

     
     Hint
    
    
For the third test case, the new Fibonacci sequence is: 2, 2, 4, 6, 10, 16, 26, 42, 68, 110…
   
   
   
    
  
  

 

#include<stdio.h>
int main()
 {
 	 int T;
 	 int i,j;
 	 __int64 tempc;
 	 __int64 a,b,c;
 	 scanf("%d",&T);
 	 while(T--)
 	  {
 	  	 scanf("%I64d%I64d%I64d",&a,&b,&c);
 	  	 if(c==a||c==b)     //记住别忘记了初始时给的两个
 	  	  {
 	  	  	 printf("Yes\n");
 	  	  	 continue;
 	  	  }
 	  	 for(i=0;;i++)
 	  	  {
 	  	  	 tempc=a+b;
 	  	  	 if(tempc>c)
 	  	  	   {
 	  	  	   	 printf("No\n");
 	  	  	   	 break;
 	  	  	   }
 	  	  	 if(tempc==c)
 	  	  	  {
 	  	  	  	 printf("Yes\n");
 	  	  	  	 break;
 	  	  	  }
 	  	  	 else
 	  	  	  {
 	  	  	  	
 	  	  	  	 a=b;
 	  	  	  	 b=tempc;
 	  	  	  }
 	  	  }
 	  }
 	return 0;
 }