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: 5ms
Memory: 1092kB
Author: 2018212212054
In contest: 1272

#include<stdio.h>
int fib[100];
int n,b,a;
int i,j;
int main()
{
	fib[0]=0;
	for(i=1;i<100;i++){
		if(i==1||i==2)
			fib[i]=1;
		else
			fib[i]=fib[i-1]+fib[i-2];
	}
	scanf("%d",&n);
	for(j=2;j<100;++j){
		if(n<=fib[j]){
			b=fib[j];
			if(n==fib[j])
				a=fib[j];
			else
				a=fib[j-1];
		printf("%d\n",a);
		printf("%d",b);
		break;
		}
	}
	return 0;
}