Start: Jul, 10, 2019 08:30:00
2019年度暑期短学期达标测试补考
End: Jul, 10, 2019 11:30:00
Time elapsed:
Time remaining:

Problem_ID: E
Result: Accepted
Time: 43ms
Memory: 1756kB
Author: 2018212212212
In contest: 1284

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<string>
using namespace std;
int b,c,T,m,n,flag;
const int maxn=110;
char a[maxn];
int fib[maxn];
int main(){
	fib[0]=2,fib[1]=3;
	for(int i=2;i<50;i++){
		fib[i]=fib[i-1]+fib[i-2];
	}
	while(~scanf("%d",&n)){
		flag=1;
		for(int i=0;i<50;i++){
			if(fib[i]==n){
				printf("Lucky Day\n");
				flag=0;
				break;
			}
		}
		if(flag)
		printf("Bad Day\n");
	}
	return 0;
}