The most interesting problem that you solved? Not necessarily from here.
| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Benq | 3676 |
| 3 | Kevin114514 | 3655 |
| 4 | maroonrk | 3463 |
| 5 | strapple | 3447 |
| 6 | Um_nik | 3387 |
| 7 | heuristica | 3322 |
| 8 | turmax | 3317 |
| 9 | tourist | 3307 |
| 10 | jiangbowen | 3291 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 156 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | Um_nik | 142 |
| 5 | Errichto | 139 |
| 6 | adamant | 136 |
| 7 | AmShZ | 135 |
| 8 | maroonrk | 133 |
| 9 | BledDest | 132 |
| 10 | qwexd | 129 |
The most interesting problem that you solved? Not necessarily from here.
| Name |
|---|



I think that this problem was a really interesting ad-hoc/math question
http://usaco.org/index.php?page=viewproblem2&cpid=1015
This problem is probably my favorite graph problem (It also uses binary search!)
http://usaco.org/index.php?page=viewproblem2&cpid=992
This problem is also a very interesting functional graph problem
http://usaco.org/index.php?page=viewproblem2&cpid=1014
Finally, I present you with a good DSU problem and a good binary search for the answer problem:
DSU: http://usaco.org/index.php?page=viewproblem2&cpid=1040
Bin. Search: http://usaco.org/index.php?page=viewproblem2&cpid=1038
Kirchoff's Current Loss from ICPC Manila 2019. Of course, I didn't solve it during the competition itself HAHAHA But I did up-solve it later here on Codeforces: https://codeforces.me/problemset/problem/1280/E
I find this problem so fascinating and interesting because of how mathematical and non-standard it is. You don't normally see these kinds of math topics in programming problems, but everything just comes together in a beautiful way.
It's not the type of problem that I think you can train to solve, other than just having years of comp prog experience to pull from.
+1, very cool problem
Reading the statement brought back memories of Physics problems <3