hdu 5018 Revenge of Fibonacci

判断第三个数是否在数列中.

#include<iostream>#define maxn 1000000using namespace std;int f[maxn];int main(){int t;cin>>t;while(t--){memset(f,0,sizeof(f));int a,b,c;cin>>a>>b>>c;f[0]=a;f[1]=b;int i;bool flag=false;for(i=2;i<maxn;i++){f[i]=f[i-2]+f[i-1];if(f[i]==c){flag=true;break;}else if(f[i]>c){break;}}if(f[0]==c||f[1]==c){flag=true;}if(flag){cout<<"Yes"<<endl;}else{cout<<"No"<<endl;}}return 0;}