Chapter 110: Who made such a perverted question

　　 Time came to seven o'clock in the evening.
　　 The distance test started, and a full hour has passed.
　　 But according to the difficulty of this set of test questions, most of the students who took the test have only completed the tenth question.
　　 Of course, except for some enchanting characters.
　　 Green City, Zhuyuan Community.
　　 Cheng Nuo rubbed his astringent eyes, moved his fingers and smiled, "Only the last ten questions are left!"
　　 That's right, compared with other scholars who are still hovering over a dozen questions, Cheng Nuo has come to question 41!
　　 This is a question that is divided into 2 points.
　　2+3=13
　　3+4=25
　　4+5=41
　　5+6=?
　　The requirements of the question are based on the laws of the three equations above to deduce how much "5+6" is equal to.
　　 After Cheng Nuo took a look, the different numbers in his mind flew around.
　　 Suddenly, the corners of Cheng Nuo's mouth slowly convulsed. "Is it the Pythagorean theorem?"
　　 Soon, Cheng Nuo filled in the answer in the blank-61!
　　 Next, reasoning question, basic score 3 points!
　　The title is as follows:
　　 There are five people A, B, C, D, and E. Everyone puts a white or black hat on their head. Everyone can see the color of the hat on others, but they can't see the color of the hat on their own.
　　 If a person wears a white hat, what he is telling is the truth; if he wears a black hat, what he is telling is a lie. What they said is as follows:
　　A said: I saw three white hats and one black hat.
　　 B said: I saw four black hats.
　　 C said: I saw a white hat and three black hats.
　　E said: I saw four white hats.
　　Q: What color is the hat each of them wears?
　　 This is a very basic reasoning question.
　　 "It's another sub-question." Cheng Nuo shook his head and chuckled. Filled in the answer as if it was easy.
　　 Cheng Nuo press the OK button to enter the next question.
　　 "After five seconds, the question will appear, please be prepared! After the question is over, please fill in the calculation result in the blank!"
　　 This prompt was displayed on the screen, with a five-second countdown number beside it.
　　 At the same time, many of the 100,000 candidates did the same as Cheng Nuo.
　　 They couldn't help but abandon their concentration, staring at the computer screen intently.
　　 3! 2! 1!
　　 A number appeared on the computer screen: 651!
　　 One second later, the first number disappeared, and the next number appeared: +157!
　　 One second later: -541!
　　 Next second: -211!
　　…………
　　 Every second, the previous number on the screen disappears and the next number appears.
　　 What the player needs to do is to sum all the numbers that appear on the screen. The result of the peace is the final answer.
　　 This question tests the quick calculation ability and memory of the contestants. To be precise, it is "or" memory.
　　 If you have enough fast calculation power, you don't need memory at all, just calculate the result when the problem is finished.
　　 But if your fast calculation is not great, you can rely on a strong memory to write down all the numbers that appear, and then slowly calculate it in your mind.
　　 Cheng Nuobucai has exactly two abilities.
　　On the memory and computing power of numbers, I am afraid that only robots can do it themselves.
　　-294!
　　+947!
　　 Ten numbers, which take ten seconds, appear on the screen in turn.
　　 When the last number "+947" disappeared under their noses, the inner thoughts of the scholars who were doing this question were like this: "???"
who am I? where am I? What am i doing?
　　This question...what am I...how to do it!
　　 One count per second, even if you remember it at the time, but when you look at the next number in the next second, you get nervous and forget the previous number. How to break it?
　　 Needless to say, remember a number incorrectly, as long as you remember a number incorrectly, this question will never be calculated right.
　　 This question may be very simple for those mental arithmetic masters who have been trained since childhood.
　　 But...for the schoolmasters who have never been exposed to this topic, I am afraid that nearly half of them will be planted here.
　　 "1024, yes, it's you!"
　　 On the other hand, Cheng Nuo quickly filled in the answer without any hesitation after the ten numbers were displayed on the screen.
　　 Don't compare speed with me, let you have a calculator, and I will be faster than you!
　　 That's right, with Rejoice, just so confident! !
　　…………
There is also a gap between 　　 school tyrants.
　　 For Cheng Nuo, a man of learning tyrants, although he has just set foot in the field of learning tyrants, he is destined to be half of the extraordinary existence.
　　From this set of test questions, we can see the difference in the level of different academic masters.
　　 Yes, they can only dominate in their respective schools.
　　 And some, the note will become the shadow of the entire Hua Guoxue scum.
　　 Cheng Nuo is one who is working hard in this direction.
　　 "Is the last question?"
　　 Unconsciously, Cheng Nuo has come to the last question.
　　 The last question is to test the players' observation ability.
　　 Basic score, five points!
　　 "After finishing this question, it's over!" Cheng Nuo smiled faintly and looked at the screen.
　　 Cheng Nuo was slightly surprised that this question actually took up ten pages of the screen.
　　 The request for this topic is like this.
　　The system will immediately generate a three-by-three nine-square grid for the players.
　　 Jiugong grid will be filled with nine small colored grids.
The color system of 　　 grid is divided into white, green, orange, yellow, red, and blue. Same as the six colors of Rubik's Cube.
　　On the ten-page screen, each page of the screen presents a 6040 grid filled with these six color systems.
　　 is the same as the Rubik's Cube Wall in the original challenge project of "The Strongest Brain". However, the arrangement of the six colors is more irregular than the Rubik's Cube wall.
　　 The player looks at the Jiugongge color block given by the system, and finds the exact position of the Jiugongge color block in his hand in the ten-sided Rubik's Cube wall according to the order of the colors, and finds it out.
　　 To be honest, the difficulty of this question is quite big.
　　 six colors of color blocks, 6040 ten cube walls.
The corresponding color arrangement order is 6040106, a total of 576,000 possible ~EbookFREE.me~ and what the contestant needs to do is to use eyes that can see through everything from these 576,000 possibilities and find And the only sort order given by the title.
　　 Ten Rubik's Cube walls, it takes a long time to read all of them.
　　 If you miss the position of the correct answer halfway...
　　 That... it feels absolutely sour!
　　 At this time, in a community not far from Cheng Nuo, a young man was restraining his urge to cry, while turning the ten Rubik's Cube walls with red eyes.
　　 It can be clearly seen that the question number displayed on his question is...1!
　　 In other words, he has already spent more than an hour on this question.
　　At this time, the door of the room was pushed open, and a figure wearing a deerstalker entered the room.
　　 He hugged his arms and looked at his brother at the computer desk, "Hey, Bai Feng, is this question so difficult? I think you have been thinking about it for more than an hour?"
　　 Bai Feng suddenly turned his head and glared at him, "Bai Yan, what you said is light, or you can do it."
　　 Bai Yan shrugged, "What's wrong with that. I'm a police detective, observation ability, but my strong point."
　　 Half an hour later, Bai Yan's wailing came from the community, "Who made such a perverted question!"
　　………………
　　PS: I found a few games to exercise my brain. The documents were sent to the book friends group.
　　Do you want to be a man of schoolmaster?
　　 Do you want a full score for each subject?
　　 Do you want to stand shoulder to shoulder with the geniuses of Tsinghua and Peking University?
　　 Then hurry up and join our top academic exchange group!
　　 The group number and the way to join the group are between Chapter 102 and Chapter 103. Everyone is welcome to join! ! !