HDU 5018 Revenge of Fibonacci（数学）

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5018

3
2 3 5
2 3 6
2 2 110

Yes
No
Yes
Hint
For the third test case, the new Fibonacci sequence is: 2, 2, 4, 6, 10, 16, 26, 42, 68, 110…
 

代码如下：

#include<cstdio>
#include<cstring>
using namespace std;
typedef __int64 LL;
int main()
{
    LL f[2017];
    int t;
    LL a, b, c;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%I64d %I64d %I64d",&a,&b,&c);
        f[0]=a, f[1]=b;
        LL i=2;
        int flag = 0;
        if(a==c || b==c)
        {
            printf("Yes\n");
            continue;
        }
        while(1)
        {
            f[i]=f[i-1]+f[i-2];
            if(f[i] == c)
            {
                flag = 1;
                break;
            }
            if(f[i] > c)
                break;
            i++;
        }
        if(flag)
            printf("Yes\n");
        else
            printf("No\n");
    }
    return 0;
}

HDU 5018 Revenge of Fibonacci（数学）

原文：http://blog.csdn.net/u012860063/article/details/39403915