Because the national Olympiad is in less than a month, I want to practice as much as I can, while documenting my progress to keep myself motivated. Join along on this improving journey!

Starting rating 1600 — Finishing rating: ?

day 0: (30 may) I participated in CodeTon8 and solved problems A, B, C1, and C2. Problem D was too difficult; I will attempt to upsolve it in the next few days. The contest was decent, but I encountered many wrong answers on problem C1 because I used a map instead of a vector. Nevertheless, I successfully solved the geometry problem, which was quite good. Performance: 1533 (-10)

Day 1: I reviewed some graph algorithms such as Dijkstra, Bellman-Ford, and bipartite graphs.

Day 2: I participated in the virtual contest for 936 (Div2). I solved problems A, B, and C. My approach to problem C was clean, and I had the right idea for problem D. I implemented it after looking at the editorial, still got 12WA in the process. Performance: 1560

Feel free to give some suggestions for problems or new algorithms to learn, and I might try them in the next few days.