Our Patreons
Diamond Sponsors
Steven & Felix Halim
Reinardus Pradhitya
Gold Sponsors
--- YOUR NAME HERE ----
Silver Sponsors
--- YOUR NAME HERE ----
Bronze Sponsors
Christianto Handojo
Krzysztof Adamek
Fatima Broom
Browse Problems
Root :: Competitive Programming 3: The New Lower Bound of Programming Contests (Steven & Felix Halim) :: Graph :: All-Pairs Shortest Paths :: Variants
Title | Total Submissions / Solving % | Total Users / Solving % | ||||
104 - Arbitrage | 33661 |
25.19%
|
7146 |
67.98%
|
||
125 - Numbering Paths | 11255 |
29.73%
|
3232 |
74.78%
|
||
186 - Trip Routing | 4786 |
31.45%
|
1583 |
70.31%
|
||
274 - Cat and Mouse | 4584 |
20.35%
|
1023 |
54.64%
|
||
436 - Arbitrage (II) | 5681 |
45.27%
|
2006 |
88.48%
|
||
334 - Identifying Concurrent Events | 3671 |
27.95%
|
1203 |
68.83%
|
||
869 - Airline Comparison | 3553 |
43.48%
|
1226 |
84.01%
|
||
925 - No more prerequisites, please! | 872 |
68.69%
|
375 |
90.67%
|
||
1056 - Degrees of Separation | 5753 |
45.09%
|
1583 |
93.49%
|
||
1198 - The Geodetic Set Problem | 578 |
53.11%
|
228 |
86.84%
|
||
11047 - The Scrooge Co Problem | 2060 |
27.91%
|
529 |
79.40%
|
<< Start < Prev 1 Next > End >> | ||
Display # | Results 1 - 11 of 11 |