Start: Mar, 13, 2018 09:00:00
计算机161 算法分析与设计 第二次实验课作业(叶瑞滨、林志伟、吴百惠)
End: Jun, 18, 2018 08:00:00
Time elapsed:
Time remaining:

Problem_ID: A
Result: Accepted
Time: 5ms
Memory: 1712kB
Author: 2017212212283
In contest: 1143

#include <iostream>
#include <cstdio>

#define MAXN 105
using namespace std;
int f[MAXN];
void fab()
{
	f[0]=1;
	f[1]=1;
	int i=2;
	while(1)
	{
		f[i]=f[i-1]+f[i-2];
		i++;
		if(f[i]>100)break;
	}
}
int main()
{
	int n;
	fab();
	scanf("%d",&n);
	int i=0;
	int min=1,max=1;
	while(1)
	{
		if(f[i]<=n)
			min=f[i];
		if(f[i]>=n)
		{
			max=f[i];
			break;
		}
		i++;
	}
	printf("%d\n%d\n",min,max);
	return 0;
 }