The Fibonacci sequence Fn is defined by Fn+2=Fn+1+Fn for n≥0, with F0=0 and F1=1. The closest Fibonacci number is defined as the Fibonacci number with the smallest absolute difference with the given integer N.
Your job is to find the closest Fibonacci number for any given N.
Input Specification:
Each input file contains one test case, which gives a positive integer N (≤108).
Output Specification:
For each case, print the closest Fibonacci number. If the solution is not unique, output the smallest one.
Sample Input:
305
Sample Output:
233
Hint:
Since part of the sequence is { 0, 1, 1, 2, 3, 5, 8, 12, 21, 34, 55, 89, 144, 233, 377, 610, ... }, there are two solutions: 233 and 377, both have the smallest distance 72 to 305. The smaller one must be printed out.
solution:
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
int mindif(int a,int b)//函数计算二数与n哪个离n最近
{
return fabs(n-a)>fabs(n-b)?b:a;
}
int main()
{
cin>>n;
int ans;
vector<int>f(3);
f[0]=0;
f[1]=1;
while(1)//f[0],f[1],f[2]三数滚轮使用
{
f[2]=f[1]+f[0];
if(f[2]>=n)
{
cout<<mindif(f[1],f[2]);
return 0;
}
f[0]=f[1];
f[1]=f[2];
}
return 0;
}