GDCPC2016 Entry Summary

School competition in the first round for a whole into the province, by the front of the team pulled to participate, met two east school side of the senior, and then recently also frequently appeared in Guangzhou (Fog) to put forward a pair of efforts to plan the appearance of the law, more efforts to expand their own brain hole.

In the East School library to see a lot of the right to the CS bibliography, think of the beautiful scene after a long time can be fetched haha haha, in addition to the morning canteen of vegetables is my heart haha haha ~

The first time I was fortunate enough to take part in provincial races, besides get a set of clothes and get quite like McDonald's lunch, more is to see the legs of the Guangdong algorithm industry, as well as look at other schools, although not in the overall reputation of the big fame, but in the final ranking is not weak.

At first it was a warm-up, and after hitting a template for a line-segment tree and then warming up the team, after a two-point search for the morph and another water problem, it turned out that the provincial race did not use the line tree 23333

A

After you get the question, start with a, give the four-sided shape of the four side length and diagonal length, judging whether it is round. At first I and teammates brain hole too big, guess a pile of wrong inference, finally the captain also guessed an undocumented method, find out four triangle circumscribed circle radius and then judge whether equal, I think I'm close to the senior grade. 2333 contributed a sine theorem + cosine theorem to find the radius. And then the problem.
In addition, after the game, we can use cosine theorem to find inscribed angle to judge 2333

K

The captain knocked a when the problem turned over, found that K is the real water problem.
F[0] = a,f[1] = B,f[n] = f[n-1] xor f[n-2] give a,b,n, ask for F[n]
Immediately moved to K found already have a lot of people, I have begun to think 10^6 array to find the loop, Muhong a look after said a sentence, XOR or two times did not come back? Orz then quickly sign in and move on to the next question.

B

Constructs a graph with each point reading at 3.
Muhong was clearly classified into two types of%4 ==0 and 2, and then wrote a construction test.

J

As follows the large troop walk posture, J question over the question quantity is big, two teammates looked at to say is the water question then began to chew,
Test instructions is the middle sequence traversal of 1~n, the number of nth (N<10^9)
Best record suggest to delete the last layer after the next to the left and right to search. Then, after a sample, the problem was quickly over.
One hours less than 1 a four questions, the situation is very good
At this time, lunch came, I looked at the translation of Moore code, took the computer to start knocking. However contributed a WA silently back down.

F

I retired after the good record said F can do.
Test instructions is a multi-account earner, and the bank charges a fee for each transfer, which is the maximum of the last person in the same time.
Obviously two points. Good record knocked over a sample, Muhong Rob past knock, put k% removed after the problem

I

The translation of Moore's code. I contributed 4 waqaq and then forwarded Muhong to another one.
When the whole team was in despair, I got the wrong test instructions, not two of the same letters, just a single space ...
So I deleted the first time I handed the code 6 lines, 6A ... After the school game again drag the penalty time Qaq

G

Game, Alice knew Bob had the minimum value. Two teammates great brain hole!!! FIGURED out the formula!!!!! ... At the end of the title ... Found to be a Nash equilibrium!!! FIGURED out the formula!!!

The last seven questions are gone, the most of a detachment over nine. I don't know if I can get a few prizes. But the last experience of the provincial races is that comrades still need to work hard. After half an hour of C, the final question is not understood ... The de problem was even more frightening to the unmanned passage.

The world is still very big.
The world of algorithms is also very large.

GDCPC2016 Entry Summary