The most interesting problem that you solved? Not necessarily from here.
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 4 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
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://mirror.codeforces.com/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