分类： 赛事动态

Three spotlights are used to light the theatre stage in the beavers' forest -- a red one, a green one and a blue one.

在海狸的森林里，有三盏聚光灯照亮了剧院的舞台——一盏红色的、一盏绿色的和一盏蓝色的。

The colour of the stage depends on which of the three spotlights are turned on.

舞台的颜色取决于三盏聚光灯中哪一盏被打开。

This table shows the possible combinations of colours.

这张表格展示了颜色的可能组合。

From the beginning of the show, the lights will be switched on and off in this pattern:

从演出一开始，灯光就会按照这种模式开启和关闭：

• The red light repeats the sequence: two minutes off, two minutes on.红灯重复这样的循环：亮两分钟，灭两分钟。
• The green light repeats the sequence: one minute off, one minute on.绿灯重复这样的模式：熄灭一分钟，亮起一分钟。
• The blue light repeats the sequence: four minutes on, four minutes off.蓝色的灯光重复着这样的模式：亮四分钟，灭四分钟。

Question: 问题:

What will the colour of the stage be in the first 4 minutes of the show?

演出开始后的前 4 分钟，舞台会是什么颜色？

Drag the correct colour onto the block of the minute.

将正确的颜色拖到分钟的方块上。

 

 

 

 

 

Explanation 解释

The way colors can be constructed from three basic colors of lights is the RGB color model. It is used, among many other places, in computer monitors and TV sets to show pictures. Pictures are made up of pixels, which are colored as a combination of the three basic colors. It is an important principle of computer hardware and computer graphics.

由三种基本色光构建颜色的方式即为 RGB 颜色模型。它被广泛应用于计算机显示器和电视机等众多领域以显示图像。图像由像素组成，每个像素都是由这三种基本颜色组合而成的。这是计算机硬件和计算机图形学中的一个重要原理。The task also involves an understanding of sequences of actions – in this case the sequence of switching particular light(s) on and off. It is an important part of algorithmic thinking. This is also an example of parallel execution of three independent sequences.

这项任务还涉及对一系列动作的理解——在这种情况下，就是特定灯光的开启和关闭顺序。这是算法思维的一个重要部分。这也是三个独立序列并行执行的一个例子。

Bebras新赛季备赛已开启，扫码领取Bebras真题资料⇓

欢迎咨询【Bebras专业辅导课程】

（Bebras每日一练部分展示）

Sergo the beaver loves to cook. His favorite meal is Chakhokhbili.

海狸塞尔戈喜欢烹饪。他最爱的菜肴是Chakhokhbili。

When cooking in the garden he uses a single gas burner. He performs the following actions after each other:

在花园里做饭时，他使用一个单头燃气灶。他依次进行以下操作：

1	Cook an onion 煮一个洋葱	10 minutes
2	Cook a bell pepper 煮一个甜椒	10 minutes
3	Combine the cooked onion and cooked bell pepper, add a tomato and cook this together把炒好的洋葱和炒好的甜椒混合在一起，再加入一个西红柿一起炒。	20 minutes
4	Cook a chicken 煮鸡	30 minutes
5	Combine everything from steps 3 and 4, add some spices, and cook it all.将第 3 步和第 4 步的所有食材混合在一起，加入一些香料，然后一起烹饪。	20 minutes

In total Sergo needs 90 minutes to prepare his Chakhokhbili on a single gas burner.

总的来说，塞尔戈用一个煤气灶做一道恰霍克比利菜需要 90 分钟。

Question: 问题:

When Sergo cooks at home he has many gas burners available. He is able to use more burners so his meal is ready sooner.

当塞尔戈在家做饭时，他有很多燃气灶头可用。他能用更多的灶头，所以饭菜能更快做好。

Which of the following statements is NOT correct?

以下哪个陈述是不正确的？

A. Sergo can reduce the cooking time by 10 minutes when using 2 burners

B. Sergo can reduce the cooking time by 30 minutes when using 2 burners

C. Sergo can reduce the cooking time by 40 minutes when using 3 burners

D. Sergo can reduce the cooking time by 50 minutes when using 4 burners

 

 

 

 

 

Explanation 解释

The correct answer is: 

正确答案是：

Sergo can reduce the cooking time by 50 minutes when using 4 burners

使用 4 个炉灶时，Sergo 能够将烹饪时间缩短 50 分钟。The left picture illustrates how to decrease the cooking time by 40 minutes, the right picture illustrates how to decrease the cooking time by 30 minutes.

左边的图片说明了如何将烹饪时间减少 40 分钟，右边的图片说明了如何将烹饪时间减少 30 分钟。

Bebras新赛季备赛已开启，扫码领取Bebras真题资料⇓

欢迎咨询【Bebras专业辅导课程】

（Bebras每日一练部分展示）

Your job is to create a program that draws the image shown at the bottom. 

你的任务是编写一个程序来绘制底部所示的图像。

Clicking the instructions in the list on the left, will put them in the available slots on the right.

点击左侧列表中的说明，会将其放入右侧的可用槽位中。

The instruction clicked first will go at the top, the second below that, etc. This pattern of instructions will be repeated six times.

最先点击的指令会排在最上面，其次点击的排在其下，依此类推。这种指令排列模式会重复六次。

Test your program my clicking the button labeled "Try". 

通过点击标有“试用”的按钮来测试您的程序。

 

 

 

 

 

Explaation 解释

Bebras新赛季备赛已开启，扫码领取Bebras真题资料⇓

欢迎咨询【Bebras专业辅导课程】

（Bebras每日一练部分展示）

Hm, what to take for lunch today?

嗯，今天午餐吃什么好呢？

The cafeteria gives instructions on how to choose a Beaver lunch.

自助餐厅给出了如何选择“海狸午餐”的说明。

This is shown as a diagram:

这以图表形式展示如下：

Below the tray you see different types of food containers.

在托盘下方，您可以看到不同类型的食品容器。

The numbers indicate how many containers of this type can be added to a tray.

这些数字表明这种类型的容器一盘最多能放多少个。

Each container can only have food items put in it that are shown below it.

每个容器中只能放入其下方所示的食品。

The numbers indicate how many food items of this type can be added to the containers.

这些数字表明这种类型的食物最多可以添加到容器中的数量。

Question: 问题:

Which of the following lunches is not a proper Beaver lunch?

以下哪份午餐不是典型的海狸午餐？

A.

B.

C.

D.

 

 

 

 

 

Explanation 解释

 is not a beaver lunch, because there is no container of the brown type of tray. In the picture there are the numbers 1 and 2 written on the image of this container indicating that one should take one or two of these.

这不是海狸午餐，因为没有棕色托盘式的容器。图片中这个容器的图像上写着数字 1 和 2，表示应该拿一个或两个。

Bebras新赛季备赛已开启，扫码领取Bebras真题资料⇓

欢迎咨询【Bebras专业辅导课程】

（Bebras每日一练部分展示）

The beaver community is designing a new dam on the river. They want to use the least number of logs. They are clever, so they want to take advantage of the small islands in the river. The picture shows the river, the islands, and the number of logs needed to build each dam segment.

河狸们正在河上设计一座新水坝。它们想用最少的原木。它们很聪明，所以想利用河中的小岛。图中展示了河流、小岛以及建造每段水坝所需的原木数量。

You can add a log to the beavers' design by clicking on a log in the picture

您可以通过点击图片中的原木，向海狸的设计中添加一根原木。

To remove a log, click on the log again.

要删除一条日志，请再次点击该日志。

The total number of logs needed for the dam is shown at the top.

大坝所需的原木总数显示在顶部。

Question: 问题:

What is the least number of logs needed for the new dam?

建造新水坝至少需要多少根原木？

Click Save answer when you think you have found it.

当你认为自己找到了答案时，请点击“保存答案”。

 

 

 

 

 

Explanation 解释

Here is the most efficient dam design:

以下是最高效的水坝设计方案：

The beavers will need 4+4+3+4=15 logs.

海狸们将需要 4×4×3×4=15 根原木。

If you are not new to Bebras, you must had seen tasks in which you have to find the shortest path between two points. Building a dam with the the least number of logs is the same as finding the shortest path from one side of the river to another, where the length of the path segments is measured by the number of logs.

如果您对“贝瓦斯”（Bebras）并不陌生，您一定见过这样的任务：在两点之间找到最短路径。用最少数量的原木建造一座水坝，这与从河的一边到另一边找到最短路径是一样的，只不过路径段的长度是以原木的数量来衡量的。

How do we systematically find the shortest path?

我们如何系统地找到最短路径？

Bebras新赛季备赛已开启，扫码领取Bebras真题资料⇓

欢迎咨询【Bebras专业辅导课程】

（Bebras每日一练部分展示）

2015年Bebras挑战练习题

Benjamin (10-12岁) 集合

名称	类型
Beaver Dam （海狸水坝）	A
Setting the table （摆桌子）	A
Mushrooms （蘑菇）	A
Bracelet （手镯）	A
Trams （有轨电车）	A
Animal Competition （动物竞争）	B
Geocaching （地图）	B
Crane Operating （起重机操作）	B
Cross Country （越野）	B
Animation （动画）	B
Walnut Animals （核桃的动物）	C
Fair share （公平的分享）	C
Quick Beaver Code 2015 （2015 快速海狸代码）	C
Binary Hotel （二进制酒店）	C
Dream Dress （梦想礼服）	C

Bebras新赛季备赛已开启，扫码领取Bebras真题资料⇓

欢迎咨询【Bebras专业辅导课程】

（Bebras每日一练部分展示）

Hamid has a 4 litre beaker full of a hazardous chemical. Kazim has an empty 3 litre beaker and another empty 1 litre beaker.
哈米德有一个装满4 升危险化学品的烧杯。卡齐姆有一个空的3升烧杯和另一个空的1升烧杯。
Hamid and Kazim want to share the chemical between them equally and need a machine to do this safely.
哈米德和卡齐姆想把这种化学物质平分，为此他们需要一台机器来安全地完成分配。
The machine can pour one beaker in to another. it stops pouring when a beaker is completely emptied or filled whichever happens first.
这台机器可以把一个烧杯里的液体倒入另一个烧杯。当任一烧杯被倒空或倒满时，它就会停止倒液。

Question: 问题:
Find the seauence of pours that produces eaual shares of the chemical for Hamid and Kazim.
找出能让哈米德和卡齐姆平分化学物质的倒液顺序。
Your sequence must use the minimum number of pours possible.
您的步骤必须使用尽可能少的倾倒次数。

Bebras新赛季备赛已开启，扫码领取Bebras真题资料⇓

欢迎咨询【Bebras专业辅导课程】

（Bebras每日一练部分展示）

Kate wants to buy her dream dress. It must

凯特想买她梦寐以求的裙子。这条裙子必须

• have short sleeves, and 有短袖，并且
• have more than 3 buttons, and 有超过 3 个按钮，并且
• have stars on its sleeves.袖子上有星星。

These four shops below sell only the dresses shown.

下面这四家店只出售所展示的这些连衣裙。

Question: 问题:

Which of these shops sells Kate's dream dress?这些商店里哪一家卖凯特梦寐以求的那条裙子？

A. BeaverYorker

B. Beaver Nova

C. B&B

D. Tom Teaver

 

 

 

 

 

Explanation 解释

Over the years, the beavers constructed a huge beaver den with many, many rooms. The rooms are numbered and arranged in a particular tunnel structure.

多年来，海狸们建造了一个巨大的海狸窝，里面有许多许多的房间。这些房间都编了号，并按照特定的隧道结构排列着。

Click on the picture to move through the den.

点击图片在洞穴中移动。

Question: 问题:

Find the room with number 1337. Click on 'Save' once you've found it.

找到编号为 1337 的房间。找到后点击“保存”。

 

 

 

 

 

 

Explanation 解释

The numbers are arranged in such a way that taking a left exit brings you to a room with a higher number, and taking the right exit brings you to a room with a lower number. Once you realize this, it is very easy to click correctly and you will find the room you are looking for. Click on the floor to go back one step.

这些数字的排列方式是这样的：从左边的出口出去会进入一个数字更高的房间，从右边的出口出去会进入一个数字更低的房间。一旦你明白了这一点，点击就会变得非常容易，你很快就能找到你要找的房间。点击地板可以后退一步。Despite the fact that there are actually 511 different rooms, one can find any room with at most 9 clicks. With every click, we can halve the number of remaining rooms. So from 511 we get down to 255, then 127, then 63 and so on down to 1.

尽管实际上有 511 个不同的房间，但最多只需点击 9 次就能找到任何一个房间。每次点击，剩余房间的数量都会减半。所以从 511 个减到 255 个，再减到 127 个，然后是 63 个，以此类推，直到只剩 1 个。

Bebras新赛季备赛已开启，扫码领取Bebras真题资料⇓

欢迎咨询【Bebras专业辅导课程】

（Bebras每日一练部分展示）

The beavers want to encode numbers. They developed the Quick-Beaver-Code (QB-Code).

海狸们想要对数字进行编码。于是它们开发出了“快速海狸码”（QB 码）。

This is a code consisting of squares. Every square has a certain value.

这是一个由方格组成的代码。每个方格都有一定的值。

The squares are filled line by line from the bottom to the top and from right to left.

这些方格是按照从下到上、从右到左的顺序，一行接一行地进行填满的。

The value of the ottom right square is 1. The other squares have double the value of the square before them.

右下角的方格的值为 1。其他方格的值都是其前一个方格的两倍。

Example: 例子:

Here is a 3x3 QB-Code. The beavers have encoded a number by darkening some squares.

这里有一个 3×3 的 QB 码。海狸们通过将一些方格涂黑来编码了一个数字。

The number encoded is the sum of the values of the dark squares.

编码的数字是所有深色方格数值的总和。

So the number encoded in this QB-Code is 2 + 32 + 64 = 98.

因此，此 QB 码所编码的数字为 2×32×64 = 98。

Question: 问题:

Of the following 4x4 QB-Codes, which one encodes the highest number?

在以下 4x4 的 QB 码中，哪一个编码的数字最大？

 

 

 

 

 

Explanation 解释

The answer is答案是 。

We will first show an example by using a 3x3 QB code

我们将首先通过一个 3×3 的二维码来展示一个示例。

We can be rearranged in a row:

我们可以排成一排：

or write it simply as 001100010. Computing the value represented by the above QB code is the same converting 001100010 from binary to decimal.

或者简单地写成 001100010。计算上述 QB 代码所表示的值，与将 001100010 从二进制转换为十进制是相同的。

Now we must think about number comparison. How do you compare 9-digit numbers written in decimal? Which one is larger, 934326958 or 936715871? You decided at the third digit, right? The first two digits are the same and the third is different, so it decides which number is larger.

现在我们必须思考数字的比较。如何比较用十进制书写的九位数？934326958 和 936715871 哪个更大？你在第三位上就做出了判断，对吧？前两位相同，第三位不同，所以它决定了哪个数更大。

Comparison in binary works the same: 010100111 is larger than 010011010. They both start with 010 and differ in the fourth digit: the second number is larger since its fourth bit is 1.

二进制数的比较方式相同：010100111 比 010011010 大。它们都以 010 开头，并且在第四个数字上有所不同：第二个数更大，因为它的第四个位是 1。

Numbers represented by A and C start with 00; B and D start with 01, so they are larger. If we compare B and D, we notice the first difference is the fourth square in the second row: D is larger.

由 A 和 C 表示的数字以 00 开头；B 和 D 以 01 开头，所以它们更大。如果我们比较 B 和 D，会发现第一个不同之处在第二行的第四个方格：D 更大。

Bebras新赛季备赛已开启，扫码领取Bebras真题资料⇓

欢迎咨询【Bebras专业辅导课程】

（Bebras每日一练部分展示）