Start: Jun, 05, 2019 17:00:00
2019春ACM通识课考试(第三场)
End: Jun, 05, 2019 20:15:00
Time elapsed:
Time remaining:

Problem_ID: F
Result: Accepted
Time: 6ms
Memory: 1792kB
Author: 2018212212094
In contest: 1272

#include<bits/stdc++.h>
using namespace std;
const int maxn1=10000;
long long p[maxn1];
int main(){
	int maxn=-1,minn=0x3f3f3f3f;
	p[1]=1,p[2]=1;
	for(int i=3;i<maxn1;i++){
		p[i]=p[i-1]+p[i-2];
	}
	double a;
	cin>>a;
	for(int i=1;i<maxn1;i++){
		if(p[i]<=a)maxn=p[i];
		if(p[i]>=a){
			minn=p[i];
			cout<<maxn<<endl<<minn<<endl;
			return 0;
		}
	}
	return 0;
}