Today is the second and last day of training. In the morning, I talked about some questions about the mutual testing of the national training teams. When I saw the name of the PPT (solutions to some cancer mutual test questions), I felt that it was very difficult, and it was indeed very difficult. There are many unanswerable questions in number theory. I’m still too naive, I basically don’t know anything about number theory, what about Mobius inversion, although I have heard of NTT, but I can’t, so I heard these algorithms when I was lecturing, “Oh, I heard it” . But then nothing will happen. The morning passed so ignorantly. Next, I still have to learn more algorithms, and I must understand it by the time of the provincial election next year!
In the afternoon, it became a little easier, and the questions were still understandable. One of the questions is to use construction, and some conditions are constructed into a determinant, which is quite clever. There is also the construction of the minimum spanning tree, and then the lecturer said that neither prim nor kruskal can work, and a metaphysical algorithm (forgot the name) is used. Then there is the boring college presentation, basically showing off how strong you are first, and then talking about what policies you have. Only the teachers from HDU were humorous and funny, which made the whole audience laugh. Actually, I really wanted to sleep (because it was so boring), but because I was sitting next to Lao Ye, I could only listen to it all obediently.
At night, my computer couldn't connect to the Internet, so I went to Antiquality's room and discussed a game theory problem with him and CHJ, which was very interesting.