hdu 5018 Revenge of Fibonacci

#include<time.h>
#include <cstdio>
#include <iostream>
#include<algorithm>
#include<math.h>
#include <string.h>
#include<vector>
#include<queue>
typedef long long int ll;
using namespace std;

ll f[1000000];

int main()
{
int cas;
scanf("%d",&cas);
while(cas--)
{
ll a,b,c;
scanf("%lld %lld %lld",&a,&b,&c);
int flag=0;
if(c==a || c==b)
{
printf("Yes\n");
continue;
}
f[0]=a;
f[1]=b;
for(int i=2;;i++)
{
f[i]=f[i-1]+f[i-2];
if(f[i]==c)
{
printf("Yes\n");
break;
}
else if(f[i]>c)
{
printf("No\n");
break;
}
}
}
return 0;
}