2022-2023年Bebras挑战练习题-Hangar Carousel(机库旋转木马)

At Beavertown Airfield, six planes are parked on a rotating turntable in a round hangar.在比弗敦机场,六架飞机停放在圆形机库中一个可旋转的转盘上。

The turntable can be rotated left or right by using a control panel with two arrows ◄►. One button press rotates the turntable exactly one parking position, either left or right. The gate of the hangar is wide enough for one plane to roll out. The turntable is very slow to rotate, so having fewer button presses will avoid delays.转盘可通过带有两个箭头“◄►”的控制面板向左或向右旋转。按一次按钮,转盘就会精确地旋转一个停车位的位置,要么向左,要么向右。机库的门足够宽,可供一架飞机驶出。转盘旋转速度非常慢,因此减少按钮按压次数可避免延误。

2022-2023年Bebras挑战练习题-Hangar Carousel(机库旋转木马)

In the mornings, when pilots come to pick up their planes, the parking position 1 is always at the gate. In the best case scenario, the arrow keys need to be pressed five times to get all planes to roll out. In these cases pilots will access the parking positions in the order: 1, 2, 3, 4, 5, 6 by pressing ► five times, or in the order: 1, 6, 5, 4, 3, 2 by pressing ◄ five times.早上,当飞行员来取飞机时,1 号停机位总是在登机口。在最佳情况下,需要按五次方向键才能让所有飞机驶出。在这种情况下,飞行员会按顺序访问停机位:1、2、3、4、5、6,方法是按五次“右箭头”键,或者按顺序访问停机位:1、6、5、4、3、2,方法是按五次“左箭头”键。

But what is the worst case scenario? That is, what order of accessing the parking positions will require the maximum number of button presses for all planes to be rolled out?但最糟糕的情况会是怎样?也就是说,哪种取车顺序会让所有飞机都驶出车位所需的按键次数最多?

Task:任务:

Provide one of such worst case order for pilots to access the parking positions 1 - 6 by dragging the numbers into the right spots.请将飞行员进入 1 至 6 号停机位的最糟糕的顺序之一通过将数字拖到正确的位置来提供。

 

 

 

 

 

Explanation 解释

There are two worst-case orders of parking positions: 4 1 3 6 2 5 and 4 1 5 2 6 3.停车位置的最差排列有两种:4 1 3 6 2 5 和 4 1 5 2 6 3。

The worst case and hence the correct answer can be found by selecting the next parking position that is always farthest away from the gate. The challenge here is to imagine the result of the turn and visualize how space for space is freed up. Because you can move the turntable in both directions, there is more than one correct solution; with six planes there are two correct solutions.最糟糕的情况,也就是正确答案,可以通过选择每次总是离大门最远的下一个停机位来找到。这里的关键在于想象转弯的结果,并设想空间是如何被腾出的。由于转盘可以双向移动,所以不止一个正确答案;对于六个飞机停机位,有两个正确答案。

4 1 3 6 2 5 :

First accessing the position 4 requires three presses (either left or right)首先访问位置 4 需要按三次键(向左或向右均可)

Next accessing position 1 requires three presses (either left or right)接下来访问位置 1 需要按三次键(向左或向右均可)

Next accessing position 3 requires two presses right接下来访问位置 3 需要向右按两次。

Next accessing position 6 requires three presses (either left or right)接下来访问第 6 个位置需要按三次键(向左或向右均可)

Next accessing position 2 requires two presses right接下来访问位置 2 需要向右按两次。

Finally accessing position 5 requires three presses (either left or right)

4 1 5 2 6 3:

First accessing the position 4 requires three presses (either left or right)首先访问位置 4 需要按三次键(向左或向右均可)

Next accessing position 1 requires three presses (either left or right)接下来访问位置 1 需要按三次键(向左或向右均可)

Next accessing position 5 requires two presses left接下来访问第 5 个位置需要向左按两次。

Next accessing position 2 requires three presses (either left or right)接下来访问位置 2 需要按三次键(向左或向右均可)

Next accessing position 6 requires two presses left接下来访问位置 6 需要向左按两次。

Finally accessing position 3 requires three presses (either left or right)最后要到达第 3 个位置需要按下三次(可以是向左按,也可以是向右按)

点击右侧文字,可获得更多在线练习题资源:>>> Bebras在线水平测试

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

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

(Bebras每日一练部分展示)

2022-2023年Bebras挑战练习题-Favorite Movie(最喜欢的电影)

A group of friends wants to choose which of seven movies to watch.一群朋友想要从七部电影中选一部来看。

Each friend rates each movie from highest to lowest: , ,  .每位朋友都按照从高到低的顺序给每部电影打分。

A movie is called a "favorite movie" if none of the friends has given another movie a higher rating.如果朋友中没有人给另一部电影打出更高的评分,那么这部电影就被称为“最喜爱的电影”。

Example:例子:

Movie 1 is NOT a favorite movie because Niklaus gave a higher rating to Movie 4.电影 1 不是最喜欢的电影,因为尼克劳斯给电影 4 的评分更高。

Task:任务:

Make as few changes as possible to the ratings so there is a favorite movie.尽量少改动评分,以便能选出一部最受欢迎的电影。

There are multiple ways to do this.有多种方法可以做到这一点。

(Click on a rating to change it and press 'Save' when you are finished.)(点击一个评分来更改它,完成后点击“保存”。)

2022-2023年Bebras挑战练习题-Favorite Movie(最喜欢的电影)

 

 

 

 

 

Explanation 解释

Answer: 答:

2 changes to the ratings is needed to make a favourite fim.要让一部电影成为热门影片,需要对评分做出 2 处调整。

One possible solution is to change Niklaus and Rósza's ratings for Movie 6.一种可能的解决办法是更改尼古拉斯和罗莎对电影 6 的评分。

There is no way to change only 1 entry such there will be a favourite movie. In the survey, for each movie another movie is rated better by at least two friends:根本无法只更改一项记录就能让某部电影成为最受欢迎的影片。在此次调查中,对于每部电影,至少有两位朋友认为另一部电影更好:

Movie 电影 That many friends rated other movies better很多朋友给其他电影的评分更高
1 4: Nancy, Niklaus, Grace, and Rózsa4:南希、尼古拉斯、格蕾丝和罗莎
2 3: Niklaus, Edsger, and Rózsa3:尼克劳斯、艾兹格和罗莎
3 3: Niklaus, Edsger, and Rózsa3:尼克劳斯、艾兹格和罗莎
4 3: Nancy, Edsger, and Rózsa3:南希、艾兹格和罗莎
5 3: Nancy, Grace, and Edsger3:南希、格蕾丝和艾兹格
6 2: Niklaus and Rózsa 2:尼克劳斯和罗莎
7 3: Niklaus, Grace, and Rózsa3:尼克劳斯、格蕾丝和罗莎

Now Ada needs to convince Niklaus and Rózsa to change one rating each such that movie 6 will be a favourite movie. Niklaus and Rósza need to improve their ratings for movie 6. Alternatively, they could downgrade their ratings for those movies they rated better than 6: that is movies 4 (Niklaus) and 5 (Rósza). It is easy to see, however, that Ada needs to consider rating improvements in similar future situations.

现在阿达需要说服尼克劳斯和罗莎各自修改一个评分,使得电影 6 成为他们最喜欢的电影。尼克劳斯和罗莎需要提高他们对电影 6 的评分。或者,他们也可以降低对那些他们评分高于 6 分的电影的评分,即尼克劳斯对电影 4 和罗莎对电影 5 的评分。然而,显而易见的是,阿达在类似未来的情况中需要考虑评分的提升。

点击右侧文字,可获得更多在线练习题资源:>>> Bebras在线水平测试

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

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

(Bebras每日一练部分展示)

2022-2023年Bebras挑战练习题-Tic-Tac-Toe(井字)

Tic-tac-toe is a paper-and-pencil game for two players. 井字棋是一种供两人玩的纸笔游戏。

Rules:规则:

Players choose who uses X as their marker and who uses O. One player starts, then both players take turns marking the spaces in a three-by-three grid with an X or an O. The player who succeeds in placing three of their markers in a horizontal, vertical, or diagonal row is the winner. If no one succeeds and all nine boxes are filled, the game ends in a tie. 玩家选择谁用 X 作为自己的标记,谁用 O。一名玩家先开始,然后两名玩家轮流在三乘三的网格中用 X 或 O 标记空格。成功将三个自己的标记连成一条横线、竖线或对角线的玩家获胜。如果没有人成功且所有九个格子都被填满,游戏以平局结束。

Example:例子:

The following images show the first two moves each player made, and the last move they made in a game.以下图片展示了每位玩家在一场游戏中所下的前两步棋以及他们所下的最后一步棋。

(The moves made on each turn are highlighted.)(每回合所下的棋步均以高亮显示。)

2022-2023年Bebras挑战练习题-Tic-Tac-Toe(井字)

The image on the right is what we call the 'result sheet' of a completed game. Not all sheets that are filled randomly with X or O are valid result sheets according to the rules presented above.右边的图像是我们所说的已完成游戏的“结果表”。并非所有随意填满 X 或 O 的表格都符合上述规则,是有效的结果表。

Question:问题:

Which of the following images is the only valid result sheet of a completed game according to the rules above?根据上述规则,以下哪张图片是唯一有效的已完成游戏的成绩单?

A.

B.

C.

D.

   

 

 

 

 

 

Explanation 解释

Answer: 答案

:

Explanation: 解释:

This is a valid game because it was won by player O and then stopped.这是一场有效的游戏,因为是玩家 O 赢得了比赛,然后游戏停止了。
Answer    is not correct. 答案不正确。

Player X has won the game, but player O has placed more marks than player X, which is not possible.玩家 X 赢得了游戏,但玩家 O 放置的标记比玩家 X 多,这是不可能的。

Since the winning player always places the last mark, they can only have more or an equal number of marks but not less.由于获胜的玩家总是放置最后一个标记,所以他们拥有的标记数量只能更多或相等,而不会更少。

Answer 2022-2023年Bebras挑战练习题-Tic-Tac-Toe(井字) is not correct because there are 5 X-marks but only 3 O-marks. That is not possible. The difference between the numbers can only be 0 or 1.答案不正确,因为有 5 个叉号,但只有 3 个圈号。这是不可能的。数字之间的差值只能是 0 或 1。

Answer  is not correct because a winner had not been determined and the fields were not all filled completely.答案不正确,因为当时尚未决出胜者,而且表格也未全部填满。

点击右侧文字,可获得更多在线练习题资源:>>> Bebras在线水平测试

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

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

(Bebras每日一练部分展示)

2022-2023年Bebras挑战练习题-Listen and Walk(听和走)

Tina, who is blind, walks through the city along the roads using her talking glasses.失明的蒂娜戴着会说话的眼镜沿着城市道路行走。

The talking glasses have cameras and an intelligent object recognition system.这款会说话的眼镜配备了摄像头和智能物体识别系统。

The glasses can recognize: a house , a tree , a road and lawn .这副眼镜能够识别:房屋、树木、道路和草坪。

 When Tina enters a new road square, the talking glasses tell her - in this order - what is on her left, what is in front of her and what is on her right.  For example: "tree, road, house".当蒂娜走进一个新的道路广场时,会说话的眼镜会依次告诉她她的左边、正前方和右边分别有什么。例如:“树、路、房子”。

Tina starts at the arrow, facing in the direction of the arrow, and listens to her talking glasses.蒂娜从箭头处开始,面向箭头所指的方向,听从她那会说话的眼镜的指引。

This is what they tell her (beginning with the starting square):这就是他们告诉她的(从起始方格开始):

  • tree, road, house 树,路,房子
  • road, road, lawn 路,路,草坪
  • tree, road, tree 树,路,树
  • road, road, road 路,路,路
  • tree, road, tree 树,路,树
  • tree, house, road 树,房子,路
  • road, road, tree 路,路,树
  • house, road, tree 房子,路,树

At the end, Tina has arrived at one of the squares labeled with a letter.最后,蒂娜来到了标有字母的一个方格处。

Question:问题:

At which letter on the map has Tina arrived?蒂娜在地图上的哪个字母处到达了?

(Click on the letter to select it. Press 'Save' when you are finished.)(点击字母以选中它。完成后按“保存”。)

2022-2023年Bebras挑战练习题-Listen and Walk(听和走)

 

 

 

 

 

 

Explanation 解释

Answer: 答案:

B

Explanation: 解释:

There are different strategies to find the solution.有多种策略可以找到解决方案。

You can just follow the path Tina takes by following the instructions given by the talking glasses. The objects do not tell us when Tina makes a turn on the road. So if, at any location, the next set of objects match objects on more than one road, we try each road at a time. For example, if we take the road to destination A, to continue along the road, we would realise that after “tree road tree” the next (4th) set of objects should have been “lawn road tree”. However the objects are “road road road” which do not match the objects on road to destination A. So we trace back to the intersection where we chose the road to destination A and take another road. We do this until we have either tried all the possible roads or until we reach one of the targets. The figure below shows possible paths Tina can take. X indicates that she could not have continued on the path.

你只需依照蒂娜所走的路线,按照会说话的眼镜给出的指示前行即可。这些物品不会告诉我们蒂娜在道路上转弯的时间。所以,如果在任何地点,下一组物品与多条道路的物品都相符,我们就依次尝试每条道路。例如,如果我们选择去目的地 A 的道路,继续沿着这条路走,我们会发现,在“树 路 树”之后,下一组(第 4 组)物品应该是“草坪 路 树”。然而,实际的物品是“路 路 路”,这与去目的地 A 的道路物品不匹配。所以我们要回到选择去目的地 A 那条路的交叉路口,再选择另一条路。我们一直这样尝试,直到尝试完所有可能的道路,或者到达其中一个目标。下图展示了蒂娜可能走的路线。X 表示她无法继续走这条路。

Alternatively, you can check the six target squares. Only B and D match the description “house road tree”.  But both squares adjacent to D do not match “road road tree”, which is the second last description. Therefore, B must be Tina’s goal square..

或者,您可以检查六个目标方格。只有 B 和 D 符合“房子 路 树”这一描述。但与 D 相邻的两个方格都不符合倒数第二个描述“路 路 树”。因此,B 必定是蒂娜的目标方格。

2022-2023年Bebras挑战练习题-Listen and Walk(听和走)

点击右侧文字,可获得更多在线练习题资源:>>> Bebras在线水平测试

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

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

(Bebras每日一练部分展示)

2022-2023年Bebras挑战练习题-Lists(列表)

We can represent a list of numbers 3,5,2,4,1 visually as follows.我们可以将数字列表 3、5、2、4、1 以如下方式直观地表示出来。

(The smaller red numbers above indicate the positions in the list named 'X.')(上面较小的红色数字表示在名为“X”的列表中的位置。)

2022-2023年Bebras挑战练习题-Lists(列表)

We write (X 2) to describe the number at position 2. So (X 2) is 5. Similarly (X 5) is 1.我们用 (X 2) 来表示位置 2 上的数字。所以 (X 2) 是 5。同样地,(X 5) 是 1。

The positions can be indicated indirectly, for example:这些位置可以间接表明,例如:

(X (X 3)) is 5 because (X 3) is 2, so (X (X 3)) = (X 2) = 5.(X (X 3)) 等于 5,因为 (X 3) 等于 2,所以 (X (X 3)) = (X 2) = 5。

Here are three lists, A, B and C.这里有三个列表,分别是 A、B 和 C。

Question:问题:

What is the number described by (A (B (C 3)))?由 (A (B (C 3))) 描述的数字是多少?

A. 1

B. 2

C. 3

D. 4

E. 5

 

 

 

 

 

Explanation 解释

Answer: 答案:

4

Explanation: 解释:

2022-2023年Bebras挑战练习题-Lists(列表)

(C 3) = 4, so (B (C 3)) = (B 4) = 3, so (A (B (C 3)) = (A (B 4)) = (A 3) = 4.(C 3) = 4,所以 (B (C 3)) = (B 4) = 3,所以 (A (B (C 3))) = (A (B 4)) = (A 3) = 4。

This can be shown by substituting these values working from the inside out:这可以通过从内向外代入这些值来证明:

(A (B (C 3))) → (A (B (4)))→ (A (3))→ (4)

点击右侧文字,可获得更多在线练习题资源:>>> Bebras在线水平测试

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

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

(Bebras每日一练部分展示)

2022-2023年Bebras挑战练习题-Flower Garden(花园)

The Flower Garden is a video game where the aim is to find the flowers without stepping on them.《花之园》是一款视频游戏,其目标是在不踩到花朵的情况下找到它们。

Rules:规则:

Players can click on a square where they don't think there is a hidden flower with the A button. This will either reveal a number or, if there is a hidden flower, they are said to have "stepped on the flower" and have lost the game. When a number is revealed, it shows how many neighboring squares have flowers in them. When a player knows where a flower is, they should "make it grow" by clicking on the square with the B button. If the player finds all the hidden flowers before stepping on one, they win the game.玩家可以点击他们认为没有隐藏花朵的方格,点击 A 键。这要么会显示出一个数字,要么如果那里有隐藏的花朵,玩家就会被说成“踩到了花朵”,从而输掉游戏。当显示数字时,它表示相邻方格中有多少朵花。当玩家知道花朵的位置时,应点击该方格的 B 键“让花朵生长”。如果玩家在踩到花朵之前找到了所有隐藏的花朵,他们就赢得游戏。

Example of a game still in progress:正在进行中的游戏示例:

2022-2023年Bebras挑战练习题-Flower Garden(花园)

A new game has been started below. The player thinks that there is a flower in one of the squares marked A, B, C, or D, but has not decided which to click with button B yet.下面开始了一个新游戏。玩家认为在标有 A、B、C 或 D 的方格中有一朵花,但还没决定用按钮 B 点击哪一个。
Task: 任务:

In which square marked A, B, C, or D is there another hidden flower?在标有 A、B、C 或 D 的哪个方格里还藏着一朵花?

(Click on the square to select it and then press 'Save.')(点击方框将其选中,然后按“保存”。)

Explanation 解释

Answer: 答案:

B

Explanation: 解释:

In the square below square A, we have a "1". We assume there is a flower below that. So "1" indicates that assumed flower and thus, square A cannot contain a flower.在正方形 A 下方的那个正方形里有一个“1”。我们假定那里有一朵花。所以“1”表示那个假定存在的花,因此正方形 A 里不能有花。

In the square to the left of square C, and above square D we have a "1". To the left of that "1" is the assumed flower. So this "1" indicates that assumed flower and, thus, square C and square D cannot contain a flower.在 C 方格左侧且 D 方格上方的位置有一个“1”。在那个“1”的左侧是假定的花。所以这个“1”表明假定的花所在的位置,因此 C 方格和 D 方格不能有花。

Square B has two neighbors with a "1". These "1"s could be referring to square B, but only the "2" on the square on the bottom left of square B, shows that a flower needs to be in square B. This "2" only has 2 neighbors which don't contain numbers and if we have the assumed flower, another flower needs to be in square B.方格 B 有两个相邻的方格标有“1”。这些“1”可能指的是方格 B,但只有方格 B 左下角的那个标有“2”的方格表明方格 B 需要种一朵花。这个“2”只有两个相邻的方格没有数字,如果按照假设种了一朵花,那么方格 B 还需要再种一朵花。

点击右侧文字,可获得更多在线练习题资源:>>> Bebras在线水平测试

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

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

(Bebras每日一练部分展示)

2022-2023年Bebras挑战练习题-Benjamins (10-12岁) 集合

2022-2023年Bebras挑战练习题

Benjamins (10-12岁) 集合

名称 类型
Lila's Guessing Game 莉拉的猜谜游戏 A
Beehive 蜂巢 A
Most Popular Book 最受欢迎的书 A
Tortoise and Hare 乌龟和野兔 A
Colorful Tower 五彩缤纷的塔 A
Heart Graphics 心的图形 B
Pantry Map 储藏室地图 B
Sailor Necklace 水手项链 B
Embroidery Machine 绣花机 B
Hamburger Recipe 汉堡包配方 B
Mary's Neighbors 玛丽的邻居 C
Lights On 亮着灯 C
Rug Weaving 地毯纺织 C
Nuts and Bolts 螺母和螺栓 C
Cipher 8 密码8 C

点击右侧文字,可获得更多在线练习题资源:>>> Bebras在线水平测试

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

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

(Bebras每日一练部分展示)

2022-2023年Bebras挑战练习题-Cipher 8(密码8)

An octagon has groups of three or four letters written at the vertices. An arrow points from the center of the octagon to a letter group. The arrow can rotate clockwise.一个八边形的顶点处写着三或四个字母组成的组。有一支箭从八边形的中心指向一组字母。这支箭可以顺时针旋转。

2022-2023年Bebras挑战练习题-Cipher 8(密码8)

Messages can be encrypted using the octagon and arrow.消息可以使用八角形和箭头进行加密。

At the beginning of the encryption of a new message, the arrow always points to the letters ABC.

We encrypt each letter of the message so that:我们对消息中的每个字母进行加密,以使:在对新消息进行加密的开始阶段,箭头总是指向字母 ABC。

  • The first number indicates how many vertices of the octagon the arrow should be rotated, starting at its current position.第一个数字表示箭头应绕八边形的顶点旋转的次数,从其当前位置开始。
  • The second number indicates the position of the encrypted letter in the letter group to which the arrow points.第二个数字表示箭头所指字母组中加密字母的位置。

Example:例子:

TREE is encrypted with the sequence 62-73-42-02.“TREE”用序列 62 - 73 - 42 - 02 进行了加密。

Question:问题:

What is the encrypted message for WATER?WATER 的加密信息是什么?

A. 72-11-26-32-53

B. 62-11-62-22-43

C. 62-11-26-22-53

D. 72-11-62-32-43

 

 

 

 

 

Explanation 解释

Answer: 答案:

72-11-62-32-43

Explanation: 解释:

We get the correct answer by gradually creating an encrypted text for the message WATER.我们通过逐步为信息“WATER”创建加密文本而得出正确答案。

The encrypted text will contain 5 codes:加密文本将包含 5 个代码:

  • At the start of the encryption, the arrow points to the letter group ABC. The letter W is located within the letter group, which the arrow will point to after rotating 7 vertices. The letter W is the second letter in the letter group VWX, so the first code is 72.加密开始时,箭头指向字母组 ABC。字母 W 位于该字母组内,箭头旋转 7 个顶点后将指向它。字母 W 是字母组 VWX 中的第二个字母,所以第一个代码是 72。
  • The second letter of the encrypted message is A. This letter is in the letter group ABC, which the arrow will point to after rotating once from its current position at letter group VWX. A is in the first position, so the second code is 11.加密信息中的第二个字母是 A。这个字母位于字母组 ABC 中,而箭头从当前指向的字母组 VWX 旋转一次后会指向该字母组。A 处于第一个位置,所以第二个密码是 11。
  • We get to the letter group containing T by rotating 6 vertices and the letter T is the second letter, so the third code is 62.我们通过旋转 6 个顶点到达包含字母 T 的字母组,而字母 T 是第二个字母,所以第三个密码是 62。
  • The letter E is in the letter group that the arrow will point to after the arrow is rotated 3 vertices and E is the second letter in the group, so the code is 32.字母 E 在箭头旋转 3 个顶点后所指向的字母组中,且 E 是该组中的第二个字母,所以密码是 32。
  • The last letter is R, in the letter group, which can be reached after rotating 4 vertices. R is the third letter, so the last code is 43.最后一个字母是 R,在字母组中,旋转 4 个顶点后可以到达。R 是第三个字母,所以最后一个代码是 43。

The whole encrypted text is 72-11-62-32-43.整个加密文本是 72 - 11 - 62 - 32 - 43 。

点击右侧文字,可获得更多在线练习题资源:>>> Bebras在线水平测试

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

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

(Bebras每日一练部分展示)

2022-2023年Bebras挑战练习题-Nuts and Bolts(螺母和螺栓)

At the Beaver Construction factory, Benoit works at the nut and bolt  assembly line.在比弗建筑工厂,贝努瓦在螺母和螺栓装配线上工作。

2022-2023年Bebras挑战练习题-Nuts and Bolts(螺母和螺栓)

His job description is as follows:他的工作职责如下:

  • Stand at one end of a conveyor belt, which brings a line of nuts and bolts.站在传送带的一端,传送带上有一排螺母和螺栓。
  • Take each element, either a nut or a bolt, off the conveyor belt.把传送带上的每个零件,不管是螺母还是螺栓,都取下来。
  • Put the nuts from the conveyor belt in the red bucket.把传送带上的坚果放进红色的桶里。
  • Attach any bolt, taken from the conveyor belt, to a nut from the red bucket and place the assembled part onto the table behind you.从传送带上取下任意一个螺栓,与红色桶里的一个螺母拧在一起,然后把拧好的部件放到你身后的桌子上。

However, things can go wrong for Benoit in two different ways:然而,对于贝努瓦来说,事情可能会以两种不同的方式出错:

  1. When Benoit takes a bolt from the conveyor belt there may not be a nut in the bucket.当贝努瓦从传送带上取下一颗螺栓时,桶里可能没有螺母。
  2. There may be no more nuts or bolts on the conveyor belt but there are still nuts in the bucket.传送带上可能已经没有螺母或螺栓了,但桶里还有螺母。

Question: 问题:

Which sequence of nuts and bolts, when processed from left-to-right, will not cause things to go wrong for Benoit?从左至右依次加工哪一组螺母和螺栓,才不会让贝努瓦出错?

A.

B.

C.

D.

   

 

 

 

 

Explanation 解释

Answer: 答案:

C.

Explanation: 解释:

We can keep track of the state of the bucket and conveyor belt from left-to-right:我们可以从左到右跟踪料斗和传送带的状态:

  • N =
  • B =
Bucket Conveyor Belt
empty N B N N B N N B B B
N B N N B N N B B B
empty N N B N N B B B
N N B N N B B B
N N B N N B B B
N N N B B B
N N N B B B
N N N B B B
N N B B
N B
empty empty

Looking at the other answers:看看其他答案:

will go wrong after N B B, since there will be no nut in the bucket when the second B is encountered.在执行了 N 次 B B 操作之后将会出错,因为在遇到第二个 B 时桶里将没有坚果了。

will go wrong after N N B N N B B B B, since there will be no nut in the bucket when the fifth B is encountered: notice there are only 4 N's before this B.在遇到第 5 个 B 时将会出错,因为此时桶里已没有坚果了:请注意,在这个 B 之前只有 4 个 N。

will go wrong after the entire sequence is processed, since there will be two nuts in the bucket, since there are 6 N's and 4 B's.在整个序列处理完毕后会出现错误,因为桶里会有两个螺母,因为有 6 个 N 和 4 个 B。

点击右侧文字,可获得更多在线练习题资源:>>> Bebras在线水平测试

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

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

(Bebras每日一练部分展示)

2022-2023年Bebras挑战练习题-Rug Weaving(地毯纺织)

Hale is a Turkish weaving artist. She is making a square rug with 6 rows (left to right) and 6 columns (up and down).黑尔是一位土耳其的织布艺术家。她正在制作一块 6 行(从左到右)6 列(从上到下)的方形地毯。

2022-2023年Bebras挑战练习题-Rug Weaving(地毯纺织)

Hale puts a symbol in each square on the grid of the rug, using the following questions:黑尔在地毯网格的每个方格中都放上一个符号,他依据以下问题进行操作:

Question: 问题:

Using this method, what would the resulting rug look like?用这种方法,最终的地毯会是什么样子?

A.

B.

C.

D.

 

 

 

 

 

Explanation 解释

Answer: 答案:

The rug Hale weaves is:黑尔编织的地毯是:

B.

The first question that Hale asks indicates that the 1st and 6th rows, as well as the 1st and 6th columns, should have purple shapes.

黑尔提出的第一个问题表明,第 1 行和第 6 行,以及第 1 列和第 6 列,应当有紫色的图形。

The second question leads to all squares on the diagonal of the rug having a red symbol, because on the diagonal the row and column numbers are the same:第二个问题导致地毯对角线上的所有方格都有红色符号,因为在对角线上行号和列号相同: 2022-2023年Bebras挑战练习题-Rug Weaving(地毯纺织)

On the next layer of questions, we find that the row number is larger than the column number in all the squares to the left of the diagonal. In these places, a blue symbol is placed:在接下来一层的问题中,我们发现对角线左侧所有方格中的行号都大于列号。在这些位置,放置一个蓝色符号:

Finally, the remaining squares to the right of the diagonal all have row numbers that are NOT larger than the column numbers, hence they are filled in with the yellow symbol, giving the answer seen in option B.最后,对角线右侧剩余的所有方格其行号都不大于列号,因此都用黄色符号填充,从而得到选项 B 中所示的答案。

点击右侧文字,可获得更多在线练习题资源:>>> Bebras在线水平测试

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

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

(Bebras每日一练部分展示)

在线客服
微信咨询