I'm finding that I'm spending an equivalent amount of time implementing vs. generating ideas.

I feel like this is slow for problems that aren't specifically tagged as implementation.

Can any expert+ coders comment on how their breakdown typically goes? Bonus points if you can break it down by problem category.

Problem link: https://mirror.codeforces.com/problemset/problem/2181/B

I'm specifically not able to make sense of this claim

In each pair of moves, at least the maximum is subtracted from the sum of all N numbers. Therefore, the total sum is multiplied by at most $$$1 − \frac{1}{N}$$$ in each step.

I've tried getting AI to explain it to me but it keeps getting confused as well :((

Link: https://mirror.codeforces.com/problemset/problem/5/A

My input reading implementation just hangs because there is no end-of-file delimiter...

Problem: https://mirror.codeforces.com/contest/36/problem/A

Link: https://mirror.codeforces.com/contest/36/submission/363724377