# Revenge of Fibonacci

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 748    Accepted Submission(s): 343

Problem Description
In mathematical terms, the sequence Fn of Fibonacci numbers is defined by the recurrence relation
Fn = Fn-1 + Fn-2
with seed values F1 = 1; F2 = 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
`32 3 52 3 62 2 110`

Sample Output
`YesNoYesHintFor the third test case, the new Fibonacci sequence is: 2, 2, 4, 6, 10, 16, 26, 42, 68, 110… `

Source
BestCoder Round #10

Recommend
heyang   |   We have carefully selected several similar problems for you:  5103 5102 5101 5100 5099

ac代码
`#include<stdio.h>int main(){int t;scanf("%d",&t);while(t--){int a,b,c,d;scanf("%d%d%d",&a,&b,&c);if(a==c||b==c){printf("Yes\n");continue;}d=a+b;while(d<c){a=b;b=d;d=a+b;}if(d==c)printf("Yes\n");elseprintf("No\n");}}`

0 0