Omnipotent Data

The time came to seven o'clock in the evening.

An hour has passed since the test started.

However, according to the difficulty of this set of test questions, most of the students who participated in the test only reached the tenth question.

Of course, except for some monster-like characters.

Qingcheng City, Zhuyuan Community.

Cheng Nuo rubbed his sore eyes, moved his fingers and smiled, "There are only the last ten questions left!"

That's right, Cheng Nuo has already reached the 41st question compared to other top academics who are still hovering around more than a dozen questions!

This is a question that is basically divided into 2 points.

2+3=13

3+4=25

4+5=41

5+6=?

The requirement of the title is to deduce what the final "5+6" is equal to according to the laws of the above three equations.

After Cheng Nuo glanced at it, different numbers raced through his mind.

Suddenly, the corners of Cheng Nuo's mouth curled up slowly. "So it's the Pythagorean theorem?"

Soon, Cheng Nuo filled in the answer in the blank - 61!

The next question is a reasoning question, the basic score is 3 points!

The title is as follows:

There are five people A, B, C, D, and E. Everyone wears a white or black hat on their head. Everyone can see the color of the hats on other people's heads, but they can't see the color of their own hats.

If a man wears a white hat, he is telling the truth, and if he wears a black hat, he is telling a lie. Here's what they said:

A said: I see three white hats and one black hat.

B said: I see four black hats.

C said: I see a white hat and three black hats.

E said: I see four white hats.

Q: What color hat is each of them wearing?

This is a very basic reasoning question.

"Another sub-question." Cheng Nuo shook his head and chuckled. Filled in the answer as if it came easily.

Cheng Nuo pressed the OK button to move on to the next question.

"After five seconds, the question will appear, please get ready! After the question is over, please fill in the calculation result in the blank!"

Such a reminder is displayed on the screen, with a five-second countdown number next to it.

At the same time, many of the 100,000 candidates did the same thing as Cheng Nuo.

They couldn't help but give up their attention and stared at the computer screen with all their attention.

3! 2! 1!

A number appeared on the computer screen: 651!

After a second, the first number disappears and the next number appears: +157!

Another 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 sum is the final answer.

This question tests the contestant's quick calculation ability and memory. To be precise, it is "speed computing power" or "memory power".

If your quick computing power is enough to cheat, you don't need memory at all, just calculate the result at the same time as the question is finished.

But if your quick calculation ability is not very good, you can rely on your strong memory to write down all the numbers that appear, and then calculate slowly in your mind.

Cheng Nuo is not talented, so it happens that he has both abilities.

In terms of memory and computing power for numbers, I am afraid that only robots can do it better than me.

-294!

+947!

Ten numbers, which took ten seconds, appeared on the screen one by one.

When the last number "+947" disappeared under their noses, the inner thoughts of the scholars who were doing this question were like this: "???"

who I am? where am I? what am i doing

This question...what the hell...how do I do it!

One count per second,

Even if I remembered it at the time, but when I look at the next number in the next second, I get nervous and forget the previous number, how can I break it?

Needless to say, if you remember a number wrong, as long as you remember a number wrong, it is impossible to get this question right.

This problem may be very simple for those mental arithmetic masters who have been trained since childhood.

But... For the top students who have never been exposed to this kind of topic, I am afraid that nearly half of them will fall here.

"1024, that's right, it's you!"

On the other side, after the ten numbers were displayed on the screen, Cheng Nuo quickly filled in the answers in the blanks without any hesitation.

Don't compare speed with me, let you have a calculator, and I will be faster than you!

That's right, using Rejoice, that's how confident you are! !

…………

There is also a gap between academic masters.

For Cheng Nuo, a man who is a top student, although he has just set foot in the field of top students, he is already destined to be an extraordinary half.

From this set of test questions, we can see the difference in the level of different academic masters.

Some can only dominate in their respective schools.

And some, Zhu will become the shadow of the entire Hua country's scumbags.

Cheng Nuo was one of the people who was working hard in this direction.

"Is it the last question?"

Before he knew it, Cheng Nuo had reached the last question.

The last question is to test the player's observation ability.

Basic score, five points!

"After completing this question, it's over!" Cheng Nuo smiled faintly and looked at the screen.

To Cheng Nuo's surprise, this question took up ten pages of the screen.

The requirements of this question are as follows.

The system will immediately generate a three-by-three nine-square grid for the players.

The Jiugongge will be filled with nine colored grids.

The color system of the lattice is divided into white, green, orange, yellow, red, blue. It is the same as the six colors of Rubik's Cube.

As for the ten-page screen, each screen presents a 60*40 grid filled with these six color systems.

It's the same as the Rubik's Cube Wall, the original challenge project of "The Most Powerful Brain". However, the arrangement of the six colors is more irregular than the Rubik's cube wall.

The contestants watch the nine-square color blocks immediately given by the system, and according to the order of the colors, find the exact position corresponding to the nine-square color blocks in their hands on the ten Rubik's Cube walls, and find them out.

To be honest, the difficulty of this question is quite large.

Color blocks of six colors, ten Rubik's cube walls of 60*40.

The corresponding color arrangement sequence is 60*40*10*6, a total of 576,000 possibilities.

What the contestants need to do is to use their own eyes that can see through all of these 576,000 possibilities to find the only arrangement order given by the title.

Ten Rubik's cube walls, it will take a long time to read all of them.

If I miss the position of the correct answer halfway through...

That... feels absolutely sour!

At this time, in a certain community not far from Cheng Nuo, a young man was suppressing the urge to cry while turning over 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 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 hat walked into the room.

He folded his arms and looked at his younger brother at the computer desk, "Hey, Bai Feng, is this question so difficult? I think you've been thinking about it for over an hour?"

Bai Feng suddenly turned his head and glared angrily, "Bai Yan, you're so eloquent, why don't you come and see."

Bai Yan shrugged, "There's nothing wrong with that. I'm a police detective, and observation is my forte."

Half an hour later, Bai Yan's wailing was heard in the community, "Such a perverted question, who the hell came up with it!"

………………

PS: I found a few small games to exercise the brain. The files were all sent to the book friend group.

Do you want to be a man of high school?

Do you want full marks in all homework exams?

Do you want to stand shoulder to shoulder with the geniuses of Tsinghua University and Peking University?

Then hurry up and join our top academic exchange group!

The group number and method of joining the group are between Chapter 102 and Chapter 103. Everyone is welcome to join! ! !