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: 1712kB
Author: 2018212212175
In contest: 1272

#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<string>
using namespace std;
int main()
{
	int a[1010];
	a[1]=1;
	a[2]=1;
	for(int i=3;i<=20;i++)
	{
		a[i]=a[i-1]+a[i-2];
	}
	/*for(int i=1;i<=20;i++)
	{
		cout<<a[i]<<endl;
	}*/
	int n;
	int minn,maxx;
	cin>>n;
	for(int i=2;i<=20;i++)
	{
		if(a[i]==n)
		{
			minn=maxx=a[i];
			break;
		}
		if(a[i]>n)
		{
			maxx=a[i];
			minn=a[i-1];
			break;
		}
	}
	cout<<minn<<endl;
	cout<<maxx<<endl;
	return 0;
}