The way of question answer: 


click "submit"--》select language “Python”
follow the format below to submit your answers, you could copy the code below, and change the answers to your own, then submit

print("1.A,2.B,3.A,4.B,5.A,6.B,7.A,8.B,9.A,10.B")


1.Billy Beaver writes down his favourite numbers, from smallest to largest when read from left to right.


Question:
Which of the following orderings of numbers is the one that Billy Beaver wrote down?
(A) 2 3 4 5 10 31 29
(B) 5123 5148 5171 5149 5189
(C) 3 10 19 24 99 101
(D) 1 100 1000 100000 10000



2.There are 10 plates in a row. There is one apple on each plate.
Kangaroo Thomas loves to jump. First, he jumps onto the leftmost plate. On each single jump after
this, he either jumps forward two plates, or backwards three plates. Thomas only jumps onto plates
with an apple. If he jumps onto a plate, he collects the apple from it, and therefore, can only jump on
each plate at most once.
An example of the two possible jumps from one plate, labelled X, is shown with arrows in the picture
below:



Question:
If Thomas collects all 10 apples, which apple does he collect last?
(A) The rightmost apple
(B) The second apple from the right
(C) The third apple from the right
(D) The second apple from the left



3.The lines in the diagram show exactly which pairs of students in a class are friends. A popular artist
releases a new song on Monday and there is a musical note beside each student that buys the song that
day.

Every day after that, if a student has not bought the song yet but at least half of their friends did buy
the song before this day, he or she will also buy the song. Otherwise they do not buy the song yet.

Question:
What is the earliest day when all students in the class own the song?
(A) Wednesday
(B) Thursday
(C) Saturday
(D) Sunday



4.Seven people are skating in a line on a very long, frozen canal. They begin as shown below.

After every minute the person at the front of the line moves to the end of the line. For example, after
one minute, U will be in front of the line, since V will move behind P.

Question:
Which skater will be at the front of the line after 60 minutes?
(A)P
(B)R
(C)T
(D)V



5.Natasha lost her robot but she knows that it is in one of the nine squares in the following 3 x 3 grid.

Natasha can remotely send a sequence of commands to the robot. She can command it to move one
square UP, LEFT, RIGHT, or DOWN. The robot will not move if there is a wall in the way. For
example, if the robot is in the centre square and is told to move LEFT, it will ignore that command
and move on to the next command. The walls are drawn on the picture by a thick (green) line.
Question:
Which of the following sequences of commands guarantees that the robot will reach the square marked
with a star no matter where the robot begins?
(A) UP - UP - LEFT - LEFT - UP
(B) RIGHT - UP - UP - LEFT - LEFT
(C) DOWN - LEFT - LEFT - UP - UP
(D) UP - RIGHT - UP - LEFT - LEFT




6.Ten ants are located on Stone A and seek to reach the food on Stone F.

The ants can only travel between the stones by walking along the straws joining the stones. No two
ants can be on the same straw at the same time. It takes each ant 1 minute to travel from a stone to
any other stone connected to it by a straw.


Question:
What is the maximum number of ants that can reach the food on Stone F after 3 minutes?
(A) 6
(B) 7
(C) 8
(D) 9



7.Given an image of an animal, a machine measures various parts of the animal: head, ears, and whiskers.
The height of a part is the distance from its lowest point to its highest point. The width of a part is
the distance from its leftmost point to its rightmost point.
These measurements are used to identify the animal based on the chart shown.

	Rabbit	Beaver	Bear	Cat
ear height	1/2 of head height	1/4 of head height	1/4 of head height	1/2 of head height
whiskers width	head width	1/2 of head width	1/2 of head width	head width
head width	1/2 of head height	1/2 of head height	head height	head height

Question:
What type of animal does the machine identify the following image as?


(A) Rabbit
(B) Beaver
(C) Bear
(D) Cat


8.An amateur electrician connected 6 bulbs (numbered 1, 2, 3, 4, 5, and 6) to 6 switches (labelled A, B,
C, D, E, and F). Each switch operates exactly one bulb but nobody knows which one. Each switch can
be either up or down, but we don't know which position corresponds to the bulb being on and which
position corresponds to the bulb being off. To make matters worse, this could be different for different
switches.
Four experiments were conducted to determine which switch is connected to which bulb. The results of
these experiments including the position of the switches and on/off status of the bulbs are shown below.

Question：
Which switch is connected to which bulb?
(A) C ->1, E  -> 2, D ->3, A  ->4, F  ->5, B  ->6
(B) C ->1, F  -> 2, E  ->3, A  ->4, D  ->5, B  ->6
(C) C  ->1, F  -> 2, D ->3, E  ->4, A  ->5, B  ->6
(D) C  ->1, F  ->2, B -> 3, A  ->4, D  ->5, B  ->6



9. Bebras Tech offers the following evening classes:
ˆ Computing (C),
ˆ Geography (G),
ˆ Language (L),
ˆ Math (M), and
ˆ Science (S).
Three beavers would like to sign up for these courses:
ˆ Xavier wants to take C, L, and M;
ˆ Yvette wants to take C, G, and S;
ˆ Zoey wants to take L, M, and S.
Bebras Tech wants to squeeze these courses into as few evenings as possible such that:
ˆ each course is offered on exactly one evening, and
ˆ beavers can take at most one course per evening.
Question：
What is the least number of evenings needed for Bebras Tech to schedule these courses?
(A) 2
(B) 3
(C) 4
(D) 5


10.Beavers play a word chain game. One beaver starts by saying a word. The other beaver must say a
different word which begins with the last letter of the previous word. Then the first beaver says another
word (which was not said yet) using this same rule, and so on. If a beaver is unable to say a new word,
that beaver loses the game. These beavers do not know many words. In fact, they can draw their entire
vocabulary like this:

Notice that an arrow out of a word points at the next possible word(s) that can be said.


Question:
What is the largest possible number of words that can be said in one game?
(A) 6
(B) 7
(C) 8
(D) 9