杭电5018--Revenge of Fibonacci

Revenge of Fibonacci

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)

Total Submission(s) : 6   Accepted Submission(s) : 2

Font: Times New Roman | Verdana | Georgia

Font Size: ← →

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…

Source

BestCoder Round #10 

 

#include<stdio.h>
long long set[10000100];
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        long long a,b,c,i;
        scanf("%lld %lld %lld",&a,&b,&c);
        set[0]=a; set[1]=b;
        if(a==c||b==c) //无数次栽在初始条件判断上； 
        printf("Yes
");
     　　else
        {
       　　　for(i=2;;i++)
            {
                set[i]=set[i-1]+set[i-2];
                if(set[i]==c)
                {
                    printf("Yes
");
                    break;
                }
                if(set[i]>c)
                {
                    printf("No
");
                    break; 
                }
            }
        }
    }
    return 0;
}