has any GM or LGM develop some standard algorithm like-dijkstra or data structure like-fenwick tree or something?
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3657 |
| 3 | jiangly | 3638 |
| 4 | turmax | 3442 |
| 5 | tourist | 3380 |
| 6 | Um_nik | 3353 |
| 7 | strapple | 3350 |
| 8 | squareOf105 | 3346 |
| 9 | heuristica | 3322 |
| 10 | maroonrk | 3310 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | nik_exists | 151 |
| 3 | maspy | 150 |
| 4 | AmShZ | 144 |
| 4 | Um_nik | 144 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 135 |
| 9 | maroonrk | 133 |
| 10 | Proof_by_QED | 131 |
has any GM or LGM develop some standard algorithm like-dijkstra or data structure like-fenwick tree or something?
| Name |
|---|



You mean whether they invented it?
Maybe some have but most of the standard algorithms of this level were invented long-long time before the foundation of codeforces, so current participants are just in a different age group than the one, that discovered those tools. So I assume most of the time algorithms they discover / write papers about are generally much more specialized or just suggest small optimizations to the classic ideas
YES