hdu 5018 斐波那契数列

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define MAX 107

using namespace std;

typedef long long LL;

LL a,b,c;
LL f[MAX];

int main ( )
{
	int t;
	scanf ( "%d" , &t );
	while ( t-- )
	{
		scanf ( "%lld%lld%lld" , &a , &b , &c );
		f[1] = a , f[2] = b;
		bool flag = false;
        if ( c == a || c == b ) flag = true;
		for ( int i = 3 ; i <= 100 ; i++ )
		{
			f[i] = f[i-1] + f[i-2];
			if ( f[i] == c ) 
			{
				flag = true;
				break;
			}
			if ( f[i] > c ) break;
		}
		if ( flag ) puts ( "Yes" );
		else puts ( "No" );
	}	
}