At the beginning of the game, what question did you want to do? I first read the A question, and I didn't understand it very much. Looking at the J question again, it feels a bit difficult, after thinking about it, there is no idea.
Then follow the list.
Question D 1y
It's a combination number problem. I didn't think about it when I wrote it. I didn't think about the sample. Then I pushed it again.
F question 1y
The extended version of Fibonacci has no problems.
Question A 8y
I started to read the wrong question, thinking that I could vote only for myself, but I hadn't tried it once, and I had to vote for m if I tried again. Later it was confirmed that m votes must be cast.
1. There is a problem in finding the location of the binary search.
If you find the first position greater than or equal to the position alone, the ranking is the distance from the end +1, so that the last ranking is 1 more. It was later changed to find together.
2. There is a place where the equal sign is not added during simulation. As a result, some places lost one vote.
G question 2y
It is a three-dimensional simulation problem. It is wrong to save the value of the corresponding scheme in the second layer, and it is taken outside the third layer loop.
H question 3y
String matching simulation questions.
1. The sample is not used, because the default value of flag is 1, and forget to set 0 when the length is not satisfied.
2. Finally judge that there is a problem with winning or losing. Both HP values are 0 and should be placed first.
J question 3y
At first I wanted to play a watch and couldn't find a pattern, but many people have passed it and should be able to push it myself.
At first I thought that Cattleya was going to go square, but it was not right. Very clever, because the stacking and the image are combined.
Because the set of lucas board timed out under the large modulus, then the combination was directly calculated by factorial.
Counting 2i 1 grid in 2n, and other than that must be even number of consecutive block types, which can be converted into selecting n number of types from n + i.
The question came out well, cleverly and solidly.
Summary: basically pay attention to long long, need to pay attention to details, it is best to check more to ensure that there is no doubt.