Hi Codeforces,

I’ve been part of the CP community for about three months now. Before diving into this world, I spent a significant amount of time in Mathematics Olympiads. However, despite the effort, I couldn't achieve the results I aimed for, and eventually, the purely theoretical nature of competitive math started to feel stagnant.

I transitioned to Competitive Programming looking for something more dynamic. What I realized quickly is that while math provides the foundation, CP requires a completely different level of logical rigor and optimization. You can't just find a solution; you must find the most efficient one. Transitioning from O(1) mathematical formulas to O(N \log N) or O(N) algorithmic implementations has been both challenging and refreshing.

I am currently focused on mastering fundamental data structures and improving my implementation speed. My goal is to break out of the beginner ranks and reach a level where my logic can withstand the toughest test cases. The grind is real, and unlike my math days, I’m not planning to quit just because I haven't reached the podium yet.