hdu 5018 Revenge of Fibonacci

大水题
 1 #include<time.h>
 2 #include <cstdio>  
 3 #include <iostream>  
 4 #include<algorithm>
 5 #include<math.h> 
 6 #include <string.h>  
 7 #include<vector> 
 8 #include<queue>
 9 typedef long long int ll;
10 using namespace std;
11 
12 ll f[1000000];
13 
14 int main()
15 {
16     int cas;
17     scanf("%d",&cas);
18     while(cas--)
19     {
20         ll a,b,c;
21         scanf("%lld %lld %lld",&a,&b,&c);
22         int flag=0;
23         if(c==a || c==b)
24         {
25             printf("Yes
");
26                 continue;
27         }
28         f[0]=a;
29         f[1]=b;
30         for(int i=2;;i++)
31         {
32             f[i]=f[i-1]+f[i-2];
33             if(f[i]==c)
34             {
35                 printf("Yes
");
36                 break;
37             }
38             else if(f[i]>c)
39             {
40                 printf("No
");
41                 break;
42             }    
43         }            
44     }
45     return 0;
46 }