In the last round Codeforces Round 838 (Div. 2) I managed to solve A, B, and C in about 45 minutes even faster than a friend of mine who is a master and faster than lots of experts. I was left with about 1:45:00 to solve D but in vain. This happens many times in recent rounds, solving the first 3 problems so quickly and D is the big obstacle that seems impossible to approach.
If anyone can give me some advice to attack D more efficiently I'll be thankful.
The same thing happens with me but with problem C . If anyone can give me some advice to attack C more efficiently I'll be thankful
Practice more,Problem C most of the time is just implementation with some basic observation Try to give mathematical proof before submitting any solution (only while practicing) Hope this helps Ps — This is my alt
The skill gap between Div2 C and D is much wider than the difference between Div2 B and C it seems. Div2 D no problems usually consist of 1700R-2100R and sometimes even higher than that
Learn to skip a problem during the contests when you are completely clueless for some time, for example 15 / 20 minutes. Move on to other problems. It's common to find a problem with higher points which is easier than a problem with less points.
Solve a lot of problem D type from the problem set.
I was able to solve D in the last round Polynomial Round 2022 (Div. 1 + Div. 2, Rated, Prizes!). I hope this performance will continue in the next rounds inshallah!
Despite that B was hacked like some LGMs and really good players :'D