= International Challenge on Informatics and Computational ing 2017 Time Allowed: 150 minutes {Tasks T1 - T10 carry 3 points each| TI. Binary Gate The beavers are hospitable and they like visit each other. However, sometimes they are not at home. Therefore, they need to leave a message for their guests using an informational gate. The beavers have come up with 4 different messages, as follows: We are athome. | We will come back Please come in. ‘at noon, p A However, Little Beaver Cheolsoo thinks it is possible to make up more than 4 messages by changing the place of these logs. ‘We will come back | We will be back Inthe evening. ‘at midnight. He knows that the logs must meet the following conditions: * The logs can only either be attached horizontally, or be removed completely. The shape and orientation of the logs are not important. Rut he does nat know exactly how many messages are possible Question / Challenge What is the maximum number of messages that are possible, including the 4 original messages? As B) 10 o6 D4 T2. Parking Lot There are 12 spaces for cars in a parking lot. Each space is labelled with a number. The pictures below show which spaces were used on Monday and which spaces were used on Tuesday. Level Benjamin (Class 5 - 6) Page 1 of 24.IBIC - International Challenge on Informatics and Computational ing 2017 Time Allowed: 150 minutes ‘Question / Challenge How many parking spaces were empty on Monday and empty on Tuesday? Ay3 B)4 O5 D6 T3. Music with repeats When beavers are performing music, such as their specialty, teeth-clapping, they are actually using almost the same notation as we humans do. In particular, they use repeat signs for indicating that a certain portion of the music should be played twice: |: AB;| Here, the letters A and B indicate different types of teeth-clapping sounds. Between each pair of repeat signs there can be one or several letters. For example, the piece above should be played ABAB Question / Challenge How should the following piece of music be played? In other words, how should it be written out fully, without repeat signs? B/:AB:BI:A A)BABABBAAACACA B) BABBBAAACCA ©)BABABABAACACA D) BABABBAACACA T4. Counting Game Beavers Alex, Ben, Clover and Diana are playing a counting game. Each beaver draws a task card which has instructions written on both sides of the card as follows. Beaver Alex: Front of the card: “Count from 1 to 10 then follow the instruction on the back of the card.” Back of the card: “Count from 1 to 5 then follow the instruction on the front of the Page 2 of 21, Level Benjamin (Class 5 - 6)IBIC - Intemational Challenge on Informatics and Computational Thinking 2017 Time Allowed: 150 minutes Beaver Ben: Front of the card: “Count from 1 to 20 then follow the instruction on the front of the card.” Back of the card: “Count from 1 to 20 then follow the instruction on the back of the card.” Beaver Clover: Front of the card: “Count all the even numbers from 2 to 1,000,000.” Back of the card: “Count all the even numbers from 2 to 1,000,000. Beaver Diana: Front of the card: “Count odd numbers from 1 to 1,000 then follow the instruction on the front of the card.” Back of the card: “Count odd numbers from 1 to 1,000 then follow the instruction on the back of the card.” Each beaver starts by following the instruction on the front of the card. Question / Challenge Which beaver will finish the task first? A) Beaver Alex B) Beaver Ben © Beaver Clover D) Beaver Diana TS. All home ‘A board game is played on a board of white and gray squares. Whit free, gray squares are wallsSome of the white squares contain: + colored shapes - circle, triangle or diamond. + home places for each shape ~ a colored square with white shape in its middle. Each shape can be moved by commands: U - up, D - down, L - left, R - right. Each command moves the shape to an adjacent square, but only if that square is empty (white and no other shape or home is on it) or if it contains the home for the shape being moved. In the latter case the shape and its home disappear from the board after the move. ‘The player's task is to command each shape so that all of them reach they homes (and disappear). For this board squares are A Oo} je the correct sequence of commands can be: circle: LL, triangle: DR RU U Level Benjamin (Class 5 - 6) Page 3 of 21.IBIC - Intemational Challenge on Informatics and Computational ing 2017 Time Allowed: 150 minutes Question / Challenge What is the correct sequence of commands for this board? ago + A) circle: RR, diamond: L DR R, circle: U U, triangle: DD R RU U B) diamond: L DL L, circle: RR U U, triangle: DD RRUU ©) circle: R R, diamond: LL D L, circle: U U, triangle: DD RRU U D) circle: R R, diamond: L DL L, circle: U U, triangle: DD RR UU 6. Shortening the Messages You are searching for objects in a field and each object is labeled with a capital letter of the alphabet (A , B,C, ...,Z). Now you want to send a short message to a friend describing all these objects. You figured out a way to make messages shorter by grouping similar objects: to count the number of occurrences of each object and to place the number in front of the object label. For example, instead of sending the message AAAAAABBBCCCCC you can send the compressed message 6A3B5C. Question / Challenge If each one letter or one digit equals to one character, how many characters will be needed after the compression of the following message: DDDDDDDEEEEEEAAAAAABBBBBFFFFFFFFFFCCCCCCCCGGGGGGGGGHH HH A) 15 B) 16 ov D)18 'T7. Swapping Dogs ‘Two types of dogs are standing as shown below. Bo Ba | Ba Ba “oe JY wo a J ba) bad) bat) ” Jd A stwap occurs when two dogs that are beside each other exchange positions. After some swaps, the three large dogs end up in three consecutive positions. Question / Challenge What is the fewest number of swaps that occurred? ANS B)6 or Ds Page 4 of 21 Level Benjamin (Class 5 - 6)IBIC - International Challenge on Informatics and Computational ing 2017 Time Allowed: 150 minutes TS. Toy factory Toys are produced by a special machine that attaches an integer code to the toys as they are released. Toys must come out of the machine in increasing order or else when they go to be shipped, they will go to the incorrect location. The toys fall from the conveyor belt into a bag as shown below. OOU0000TU ‘Question / Challenge Which toy above needs to be removed so that the remaining are in increasing order? ) By , ~ J ° D) {Level Benjamin (Class 5 - 6) Page 5 of 24.IIC - Intemational Challenge on Informatics and Computational Time Allowed: 150 minutes ing 2017 T9. Message Service Violet wants to send a long message to Leo with a help of some beavers. She breaks the message into groups of at most 3 letters in each card, and gives each beaver one card with these letters. Violet knows that sometimes the beavers get distracted while they transport their card, and they arrive at different times. Therefore, Violet numbers the cards in order before giving them to the beavers. Leo must then order the cards to determine the message. For example, to send the message DANCETIME, Violet creates 3 cards as: 1 2 3 DAN CET IME When Leo received the following sequence of cards from the beavers: 3 5 2 7 é key cKs Hoc cer stl Question / Challenge ‘What was the original message? A) GETSTICKYSHOCKS B) STICKYGETHOOKS C) GETHOCKEYSTICKS D) KEYCKSHOCGETSTI T10. Tour Guide Peanut is a tour guide, who knows all the Beaver City's attractions. She works out a tour for tourists at the Hotel to visit several attractions in one day. She plans to take public buses to go from one attraction to the next. The Beaver City Map shows all possible bus-connections between attractions. KKK ss fr Galery Wtf Sciere Centre Page 6 of 2. Level Benjamin (Class 5 - 6)IBIC - Intemational Challenge on Informatics and Computational Thinking 2017 Time Allowed: 150 minutes Question / Challenge Which of the following paths can be done with exactly four bus rides, without visiting the same attraction more than once? A) From the Park to the Science Center B) From the Waterfall to the Science Center C) From the Aquarium to the Waterfall D) From the Restaurant to the Art Gallery [Tasks Ti — T20 carry 4 points each| TI. Jumpers Peter and Henrietta are playing a simple video game together. The point of the video game is to move the Beaver from the start to the finish, jumping between platforms. The platforms are on two levels: the bottom’, where the Beaver always starts, and the "top". The amount of time to move over each platform of the game is shown below each platform. For example: + the Beaver is at point A 3 seconds after the start; + the Beaver is at point B 5 seconds after the start; + the Beaver is at point C 10 seconds after the start; + the Beaver is at finish 15 seconds after the start. start finish 5 5 Notice that the Beaver can instantly jump up or jump down between platforms. Peter and Henrietta start playing the game on their own video game console at exactly the same time, However, they are playing different scenarios within the game. The two scenarios are shown below: finish Peter's scenario. e —— 3 4 4 3 start finish Henrietta's scenario Serer erence eee ereeert eee ere 2 2 2 2 2 2 @ {Level Benjamin (Class 5 - 6) Page 7 of 24.IBC - International Challenge on Informatics and Computational ing 2017 Time Allowed: 150 minutes Question / Challenge For how many seconds are both Peter's and Henrietta’s Beaver moved along the top level at the sante tine? Ay B)4 O6 Ds T12. LeftRight The beavers have made a code that uses this map: + Every tree in the park is named with a letter. * The code for each letter is found by how to get to its tree by turning left and right, + The code for each letter always starts from the park entrance. Examples Example 1: The code for A is LL because to get to tree A from the park entrance you must turn left twice, Example 2: The code for the word BAR is LRLLLR. Question / Challenge How many letters are there in the beaver's code for the word BEAR? Ayo B)7 ou D9 TIS. Red Light, Blue Light Betty Beaver sends messages to her friend using 7 lights, each of which can be red or blue.Betty uses the first 5 lights to indicate the letter to send. To show that the message is valid, Betty uses the last 2 lights in the following way: + the 6th light is blue if there is an even number of blue lights amongst the first 5 lights; otherwise, the 6th light is red; + the 7th light is red if there is an even number of red lights amongst the first 6 lights; otherwise, the 7th light is blue. Page 8 of 24. Level Benjamin (Class 5 - 6)IBIC ~ International Challenge on Informatics and Computational Thinking 2017 Time Allowed: 150 minutes Remember that 0 is an even number. For example, if Betty has set the first 5 lights as: then the 6!" light should be blue (since there are 2 blue lights in the first 5 lights), and the 7* light should be blue (since there are 3 red lights in the first 6 lights). So, she should use the following pattern: Question / Challenge Which of the following patterns is a valid message? OO00000 QO@000060 OOSO00SO »@O0606000 T14. Run Encoding In the Samantha's class the data is written down as a sequence of pictures of beavers and trees like this VEVVESSSSSS COS VEE Samantha has a brilliant idea to write down this data in a shorter way. For example, instead of writing down the above sequence Samantha will write down the sequence g 56124 Level Benjamin (Class 5 - 6) Page 9 of 2.= International Challenge on Informatics and Computational ing 2017 Time Allowed: 150 minutes That is, first she will write down the initial picture, which is either a beaver or a tree; then she will write the number of appearances of that picture in a row. Then she will look for the next different picture and write down the number of its appearances in a row, then she will look for the next one and so on... Samantha looks back at her notes and finds the sequence: ? 421132 Question / Challenge ‘What was the original sequence of beavers and trees? FPP P PO ECP COP ES POPP EES CPSP EY VSEVVPSLPEELSCS PRVCVCSSLVEVELTS TIS. Give Me a Smile The beavers have developed a system detecting smiling human faces on a camera image. It works in two steps: 1) Pre-processing: The image of a face is transformed to a smiley-like face model consisting of two spots and a line indicating the positions of eyes and the mouth. — 2) Smile-detection: The smiley-like face model is checked with a pattern consisting of red lines and four green spots. Page 10 of 21 Level Benjamin (Class 5 - 6)ing 2017 = Intemational Challenge on Informatics and Computational Time Allowed: 150 minutes The face model is accepted as a smiling face, if and only if it touches all green spots it = and does not touch a red line. ae ME smiling face not a smiling face ‘Question / Challenge How many smiling faces are detected on this image, which already has been pre- processed? oe D)8 Ay6 B)4 Os T16. Bebragram 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, ifa student has not bought the song yet but at least half or more of their friends have (on a previous day), he or she will also buy the song. Otherwise they do not buy the song yet. Poge 11 of 24 Level Benjamin (Class 5 - 6)IBIC - International Challenge on Informatics and Computational Thinking 2017 Time Allowed: 150 minutes Question / Challenge On what day will all the students own the song? A) Saturday B) Thursday C) Wednesday D) Sunday TI7. Flags Flags, as other pictures, are represented in computers by matrices (rectangular arrays of numbers). The simplest way is to represent “black and white” versions and to put 1 for white and 0 for black, The matrix in Fig. 1 represents one possible flag, ome ep aa so1010 an | f oro101 ain nm 2 101010 111100 o1o110 2 ono101r 11000 tom 3 ro1010 ‘110000 4 oro101 100000 : Figst Fig.2 Fig. The position of every element (0 or 1) in the matrix is represented by its coordinates, as shown in Fig, 2. Let's assume that there are 2 different types of flags represented with matrices of 6 rows and 6 columns (Chess flag, shown in Fig. 3, and Triangle flag, in Fig. 4). Question / Challenge Your friend picks one of the two flags. If he tells you only that the element in the position (1, 4) is 1, can you guess which flag he has picked? A) Chess flag B) Triangle flag ©) It can be either Chess flag or Triangle flag, D) Neither Chess flag nor Triangle flag have 1 in that position TIS. Five sticks ‘Adam has five sticks. He puts them on the table and creates this shape’ Page 12 of 21 Level Benjamin (Class 5 - 6)IBIC - International Challenge on Informatics and Computational Thinking 2017 Time Allowed: 150 minutes Nola comes to the table. She takes one stick and puts it in a different place: ‘Then Bob comes to the table, He also takes one stick and puts it in a different place. Question / Challenge Which shape is Bob not able to make? a) B) ° D) T19. Files ‘Tom, Peter, Anne, Mark, Jenny, Joanne are friends. ‘Tom stores text files containing stories about his adventures with his friends in a folder called "Our-Stories". He wants to collect all the files mentioning “Anne”. For that, he runs a program that copies all files containing either "Anne" or “anne” into a newly created folder called "Anne-Stories". But Tom realizes that the new folder might contain files that contain “Joanne”, but not only “Anne” He then runs a second program that deletes all files from "Anne-Stories” that contain “Joanne”. Question / Challenge ‘Tom has made a mistake. Which one? A) With this approach some text files mentioning Joanne might remain in “Anne- Stori B) Tom will be deleting all files in the folder “Anne-Stories”. ) Some files containing “Anne” may be mi ing from the folder “Anne-Stories”. D) Tom has to take into consideration whether Anne or Joanne are mentioned first in the text. Level Benjamin (Class 5 - 6) Page 13 of 22IBIC - Intemational Challenge on Informatics and Computational Thinking 2017 Time Allowed: 150 minutes 720. What is THIS? Beatrice Beaver is playing around with her new computer screen. It is very simple: it has only 9 squares on it, arranged in 3 rows of 3 columns, as shown here: She can paint some squares black. For example, if she painted only the top-left square, the image on the screen would look like: Her computer also has "rotate" and “invert” buttons. The “rotate” button will rotate the image clockwise by 90 degrees. The "invert" button will change all white squares to black and all black squares to white. For example, when Beatrice presses the "rotate" and “invert” buttons after painting the top-left square, she can create a total of 8 different patterns: | . ih ar Question Starting from the images of the letters T, H, I and S, from which of them can Beatrice make the largest number of different patterns using the "rotate" and “invert” buttons? A) 8B) oO D) Page 14 of 21 Level Benjamin (Class 5 - 6)IBIC - International Challenge on Informatics and Computational ing 2017 Time Allowed: 150 minutes {Tasks T21 - T30 carry 5 points each] T21. Book-sharing Club This diagram shows the relationship between 7 students in a book-sharing club. Their names and ages are also shown.The club has some regulations for members: When you receive an unread book, you read it, then pass it to the youngest friend who has not read it yet: If all your friends have read the book. you should pass it to the friend who gave it to you. Now Ben has read a new book and wants to share it with his — — Se ea eas ‘Question / Challenge Who will be the last reader of the book? A) Tom B) Sara © Bill D) Kim 722. Library Jack and Sue work in the school library. Books are arranged on a one meter-long shelf, When a book is borrowed, they pick it up from the shelf, leaving an empty space as thick as the book. Each day, all returned books are stacked on a table. Before closing the library, Jack and Sue put the books back on the shelf, However, they each use a different approach: * Jack takes the first book in the stack, scans the shelf from left to right and places the book in the first empty space large enough to store it. He does the same until he places all the books or finds a book which he is not able to place. + Sue places each book in the biggest empty space that can store the book or the leftmost largest available space if there is a tie, and stops when either all books have been placed or when she finds a book which she is not able to place {Level Benjamin (Class 5 - 6) Page 15 of 22IBIC - International Challenge on Informatics and Computational Thinking 2017 Time Allowed: 150 minutes At the end of a day the shelf is organized as follows, with free spaces denoted in centimeters. Consider the following stacks of returned books (the first is on the top of the stack) The books are taken from this stack, rotated vertically and then placed back on the shelf. Question / Challenge Which of the stacks below lets Jack place more books on the shelf than Sue? —— =] eS ee ee Co [o—] fo— SS a — — jo— | Lg Fo === SS A) B) oO D) 123. Tunnels of the Homestead Dam “Homestead Dam” has tunnels that connect four rooms (A, B, C, F). The first three rooms (A, B, and C) are living rooms, the fourth room (F) is where food is stored (see figure). Page 16 of 21 Level Benjamin (Class 5 - 6)IIC - Intemational Challenge on Informatics and Computational Thinking 2017 Time Allowed: 150 minutes 10 beavers are staying in room A, they are becoming hungry and they want to go to room F to eat, Since all beavers are very hungry, they all want to arrive in the food storage as soon as possible. It takes 1 Minute to traverse a tunnel and only one beaver may traverse a tunnel at the same time (not several beavers following each other). ‘The connections between the rooms are composed by a certain number of tunnels: + Between A and B: 4 tunnels, + Between A and C: 1 tunnel. + Between B and C: 2 tunnels. + Between Band F: 1 tunnel. + Between C and F:3 tunnels, The rooms have no capacity limits, that is in all rooms there can be as many beavers as want to be there. Question / Challenge What is the maximal number of beavers that can arrive in the food storage in exactly 2 Minutes? A)2 B)3 o4 D)5 ‘T24, Cipher Wheel ‘A beaver left a secret message on his tombstone by using the cipher wheel and we want to figure out what it means. The wheel works such that only the inner wheel (with small letters) can be rotated. ‘The outer wheel Is for the actual message.As you can see in the first image, when the key is 0, ‘A’ is encoded as ‘a’. As shown in the second image, when the key is 17 (because the inner wheel has been rotated by 17 positions counter-clockwise), ‘A’ is, encoded as 'r Level Benjamin (Class 5 - 6) Page 17 of 22IBIC - International Challenge on Informatics and Computational ing 2017 Time Allowed: 150 minutes With the key equal to 17, we will encode the message “WHO ARE YOU" to “nyf riv par. ‘Question / Challenge ‘What does the message (j ep fjgema) mean if we know that the beaver used such a coding process that for the first letter the key is 1, while the key for the second letter is 2, the key for the third letter is 3, etc.? ” Tr] [plo] [C/OJO]K]I JE ” Tul {plo | (B/EJA|V/E/R ° Tr |{al[m] [BJEJA|V|E|R ” Tr |[alm|{C]A|S|T/O|R 725. Dam construction Four beavers are building a dam. They use a plan as drawn below. The tasks have to be done in the order indicated by the arrows. The numbers in the yellow circles indicate how many hours each task takes. Every task is always performed by a single beaver. After the beavers found the best place to build the dam, one beaver decided to take a four hour nap, so his task will be delayed by four hours. Question/Challenge Which of the four tasks should be postponed in order to minimize the delay in finishing the dam? A) Collect thick branches B) Collect thin branches ©) Collect stones D) Collect mud Page 18 of 21 Level Benjamin (Class 5 - 6)IBIC - International Challenge on Informatics and Computational ing 2017 Time Allowed: 150 minutes 126. One Too Many Irecently discovered a stupid mistake I made in a long long text I have written. All T's should be 11's and all 11's should be 1's. Luckily, I have an editor in which I can replace a sequence of characters with another sequence. See what happops in a soptopce in which I replace all occuropces (except the last one) of en with op! Of, wofse, feplacing all occuffences of r (except the last one) with f. Question / Challenge What did I do to fix my text? Hint: ($ is a character not used in the text!) A) replaced all 11's with 1's and then all 1's with 11's. B) I replaced all 1's with 11's and then all 11's with ©) [replaced all 1's with §’s and then all $’s with 11's and then alll 11's with 1's, D) [replaced all 11's with $’s and then all 1's with 11's and then all $’s with 1's. 127. Brackets ‘A jewellery shop produces bracelets. They use bracket-shaped ornaments that come in pairs. To make a bracelet you start with one of those pairs: oo Additional bracket pairs are inserted repeatedly at any place of the bracelet, as you 7, i {OH coon COOH Question / Challenge Which of the following bracelets is made with the method described? “(OD CIO} “IME | OH Level Benjamin (Class 5 - 6) Page 19 of 22IBIC - Intemational Challenge on Informatics and Computational Thinking 2017 Time Allowed: 150 minutes 128. Board Fence ‘A painting robot has a row of colour buckets. Not every bucket is full of colour. The robot is painting the boards in a fence. He is painting every board with one colour. Then he continues painting the next board with the colour in the next bucket in the row. When he reaches the last bucket in a row he starts again from the first bucket. Once a bucket is empty the robot withdraws it from the row. The robot continues painting until all buckets are empty or until he would have to paint the next board with the same colour as the previous board. At the beginning he has buckets with these amounts of color: + red colour for 5 boards + green colour for 3 boards «yellow colour for 7 boards + blue colour for 2 boards ‘Question / Challenge After how many painted boards he will finish? AS B)8 ov D)15 129, The assembly line Michelle has a car-building factory with three teams in charge of three different tasks: one team builds the engine, another team builds the car body, and another team paints the car. To produce an individual car one must first build its engine, after that complete its body, and finally paint it. Each task takes 90 minutes. Therefore, working on one task after another, Michelle thought they would need 90 x 3 = 270 minutes per car. The figure shows Michelle's idea. 90. 90, 90 , 90 ame Li Page 20 of 21 Level Benjamin (Class 5 - 6)IBIC - Intemational Challenge on Informatics and Computational Thinking 2017 Time Allowed: 150 minutes However, one of the workers suggested a faster way to build cars by making different teams work simultaneously. For example, one team can paint one car while another team is building the engine of a different car. Question / Challenge Working in the fastest possible way, how many minutes are between producing, consecutive cars? A) 150 minutes B) 30 minutes © 120 minutes D) 90 minutes 130. Washing machine A washing machine has five different commands: §V5h, HRSG, SBI, fill (with clean water) and SES. For the washing machine to work correctly’ © every fHRSE must be immediately followed by a GAIN and © every GESIN must be immediately followed by a Sil and © every fill must be immediately followed by a NSE. The expression 3 (...) means that commands in brackets are repeated 3 times. We want the machine to wash once and rinse three times in clean water. Question / Challenge ‘Which of these sequences of commands makes the machine wash once and rinse three times in clean water? A) 3 on B) Et ) ° 3 a : a Level Benjamin (Class 5 - 6) Page 21 of 22