本文主要是介绍hdu 5018 Revenge of Fibonacci(模拟)，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！
题目：http://acm.hdu.edu.cn/showproblem.php?pid=5018
Revenge of Fibonacci
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 940 Accepted Submission(s): 427
Problem Description
In mathematical terms, the sequence Fn of Fibonacci numbers is defined by the recurrence relation
F n = F n-1 + F n-2
with seed values F 1 = 1; F 2 = 1 (sequence A000045 in OEIS).
---Wikipedia
Today, Fibonacci takes revenge on you. Now the first two elements of Fibonacci sequence has been redefined as A and B. You have to check if C is in the new Fibonacci sequence.
F n = F n-1 + F n-2
with seed values F 1 = 1; F 2 = 1 (sequence A000045 in OEIS).
---Wikipedia
Today, Fibonacci takes revenge on you. Now the first two elements of Fibonacci sequence has been redefined as A and B. You have to check if C is in the new Fibonacci sequence.
Input
The first line contains a single integer T, indicating the number of test cases.
Each test case only contains three integers A, B and C.
[Technical Specification]
1. 1 <= T <= 100
2. 1 <= A, B, C <= 1 000 000 000
Each test case only contains three integers A, B and C.
[Technical Specification]
1. 1 <= T <= 100
2. 1 <= A, B, C <= 1 000 000 000
Output
For each test case, output “Yes” if C is in the new Fibonacci sequence, otherwise “No”.
Sample Input
3 2 3 5 2 3 6 2 2 110
Sample Output
Yes No YesHintFor the third test case, the new Fibonacci sequence is: 2, 2, 4, 6, 10, 16, 26, 42, 68, 110…
#include <iostream>
#include <cstdio>
using namespace std;int main()
{//freopen("cin.txt","r",stdin);int t;cin>>t;while(t--){int a,b,c;scanf("%d %d %d",&a,&b,&c);int q1=a,q2=b,q=a+b;if(c==q1 || c==q2 || c==q){printf("Yes\n");continue;}while(q<c){a=b;b=q;q=a+b;}if(q==c) printf("Yes\n");else printf("No\n");}return 0;
}这篇关于hdu 5018 Revenge of Fibonacci(模拟)的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！
