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[];

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