PAT A 2020年冬 7-1 The Closest Fibonacci Number AC代码

7-1 The Closest Fibonacci Number (20 分)

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.

AC代码：

#include<iostream>
using namespace std;
int N,ans1=0,ans2;
void Fs(int n,int f1,int f2){
	if(f1+f2>n){
		ans2=f1+f2;
		if(f2>=ans1) ans1=f2;
		return;
	}
	Fs(n,f2,f1+f2);
}
int main(){
	cin>>N;
	Fs(N,0,1);
	if(ans2-N>=N-ans1){
		printf("%d\n",ans1);
	}else{
		printf("%d\n",ans2);
	}
	return 0;
}