| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | jiangly | 3631 |
| 4 | Kevin114514 | 3574 |
| 5 | maroonrk | 3521 |
| 6 | strapple | 3515 |
| 7 | Radewoosh | 3461 |
| 8 | tourist | 3428 |
| 9 | turmax | 3378 |
| 10 | Um_nik | 3376 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 140 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 133 |
|
+35
Congrats piyush_pransukhka for master!!!! |
|
-8
Stop learning useless algorithms, go and solve some problems, learn how to use binary search — by (You know this :p) |
|
+1
Daily dose of Entertainment XD |
|
+2
Meanwhile someone(me) stuck in gold T_T |
|
0
It's the problem of -> Spoiler 0-1 bfs another spoiler |
|
0
I did the same mistake !! Thanks for the solution :) btw did u solve q8 ?? I'll be glad to know about it's solution. |
|
0
Damn!! I didn't knew about it T_T |
|
0
You can refer to this Blog it may help you — https://www.baeldung.com/cs/graph-number-of-shortest-paths |
| Name |
|---|


