您當前位置：首頁 > php開源 > 綜合技術 > A. MUH and Sticks（Codeforces Round #269)

A. MUH and Sticks（Codeforces Round #269)

來源：程序員人生發布時間：2014-10-08 08:00:01 閱讀次數：3254次

Two polar bears Menshykov and Uslada from the St.Petersburg zoo and elephant Horace from the Kiev zoo got six sticks to play with and assess the animals' creativity. Menshykov, Uslada and Horace decided to make either an elephant or a bear from those sticks. They can make an animal from sticks in the following way:

Four sticks represent the animal's legs, these sticks should have the same length.
Two remaining sticks represent the animal's head and body. The bear's head stick must be shorter than the body stick. The elephant, however, has a long trunk, so his head stick must be as long as the body stick. Note that there are no limits on the relations between the leg sticks and the head and body sticks.

Your task is to find out which animal can be made from the given stick set. The zoo keeper wants the sticks back after the game, so they must never be broken, even bears understand it.

Input

The single line contains six space-separated integers li (1?≤?li?≤?9) ― the lengths of the six sticks. It is guaranteed that the input is such that you cannot make both animals from the sticks.

Output

If you can make a bear from the given set, print string "Bear" (without the quotes). If you can make an elephant, print string "Elephant" (w?thout the quotes). If you can make neither a bear nor an elephant, print string "Alien" (without the quotes).

Sample test(s)

input
4 2 5 4 4 4

output
Bear

input
4 4 5 4 4 5

output
Elephant

input
1 2 3 4 5 6

output
Alien

Note

If you're out of creative ideas, see instructions below which show how to make a bear and an elephant in the first two samples. The stick of length 2 is in red, the sticks of length 4 are in green, the sticks of length 5 are in blue.

代碼：

#include <iostream> #include <cstdio> #include <cstring> using namespace std; int a[100]; int main() { memset(a,0,sizeof(a)); int x; int sign=0; for(int i=0;i<6;i++) { scanf("%d",&x); a[x]++; } for(int i=0;i<=10;i++) { if(a[i]>=4) { sign=1; a[i]=a[i]-4; break; } } if(sign) { int x; for(int i=0;i<=10;i++) { if(a[i]) { x=i; break; } } if(a[x]==2) { printf("Elephant "); } else printf("Bear "); } else printf("Alien "); return 0; }

生活不易，碼農辛苦
如果您覺得本網站對您的學習有所幫助,可以手機掃描二維碼進行捐贈
程序員人生

------分隔線----------------------------

上一篇 Arcgis for Javascript API下類似于百度搜索A、B、C、D marker的實現方式

下一篇 printf 格式問題

分享到:

------分隔線----------------------------

為碼而活

積分：4237

15粉絲

7關注

欄目熱點

多多色-多人伦交性欧美在线观看-多人伦精品一区二区三区视频-多色视频-免费黄色视屏网站-免费黄色在线

A. MUH and Sticks（Codeforces Round #269)