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: 1092kB
Author: 2018212212001
In contest: 1272

#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int maxn=3e4+10;
int a[30];
int main(){
	int n;
	while(~scanf("%d",&n)){
		a[1]=1;
		a[2]=1;
		for(int i=3;i<30;i++)
			a[i]=a[i-1]+a[i-2];
		int ans1,ans2=0;
		for(int i=1;i<30;i++){
			if(a[i]<=n)
				ans1=a[i];
			if(a[i]>=n){
				if(ans2==0)
					ans2=a[i];
			}
		}
		printf("%d\n%d\n",ans1,ans2);
	}
}