codeforces Round #269(div2) A解题报告

最新推荐文章于 2020-09-15 16:42:39 发布

原创最新推荐文章于 2020-09-15 16:42:39 发布 · 911 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#codeforces #没啥算法

codeforces 同时被 2 个专栏收录

73 篇文章

订阅专栏

codeforces

70 篇文章

订阅专栏

本文介绍了一个有趣的编程挑战，通过分析六根棍子的长度来判断能否拼成熊或象的形状。文章提供了两种不同的解题思路及对应的代码实现，一种是通过计数方式，另一种则是通过排序比较。

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.

$\text{[math]}$

题目大意：

给出6个棍子，看看是否可以拼成“熊”或者“象”。

其中，“熊”为4根棍子长度一样，另外两根棍子长度不一样；“象”则是4根棍子长度一样，另外两根棍子长度也一样。

解法：

首先判断是否有4根一样长的棍子，没有则不可能拼出，输出“Alien”。

然后再判断剩下的两根棍子是否一样，一样是象，不一样则是熊。

代码：

#include <cstdio>

int u1[10];

void init() {
	for (int i = 1; i <= 6; i++) {
		int tmp;

		scanf("%d", &tmp);
		u1[tmp]++;
	}
}

void solve() {
	for (int i = 1; i <= 9; i++)
		if (u1[i] >= 4) {
			u1[i] -= 4;

			for (int j = 1; j <= 9; j++)
				if (u1[j] == 2)
					printf("Elephant");
				else if (u1[j] == 1) {
					printf("Bear");
					break;
				}

			return;
		}

	printf("Alien");
}

int main() {
	init();
	solve();
}

官方解题报告：

地址：http://codeforces.com/blog/entry/13986

切入点跟我的想法类似，但是看了官方的代码却是另一种写法。先排序，如若存在4个相同长度，则排序后必然有4个连续相同的数字，然后把剩余的数字进行对比。

官方代码：

#include <algorithm>
#include <iostream>
#include <vector>

using namespace std;

int main() {
	vector<int> l(6);
	for (int i = 0 ; i < 6 ; i++) cin >> l[i];
	sort(l.begin(), l.end());
	
	     if (l[0] == l[3]) cout << (l[4] == l[5] ? "Elephant" : "Bear");
	else if (l[1] == l[4]) cout << "Bear";
	else if (l[2] == l[5]) cout << (l[0] == l[1] ? "Elephant" : "Bear");
	else cout << "Alien";
}