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: Increasing the Lower Bound of Programming Contests (Steven & Felix Halim) :: Chapter 3. Problem Solving Paradigms :: Dynamic Programming :: Non Classical (medium difficulty)
| Title | Total Submissions / Solving % | Total Users / Solving % | ||||
|
|
116 - Unidirectional TSP | 71461 |
25.56%
|
12914 |
72.85%
|
|
|
|
473 - Raucous Rockers | 5318 |
27.45%
|
950 |
75.37%
|
|
|
|
607 - Scheduling Lectures | 8014 |
27.89%
|
1695 |
66.02%
|
|
|
|
10003 - Cutting Sticks | 60221 |
48.74%
|
15539 |
90.04%
|
|
|
|
10337 - Flight Planner | 6908 |
50.91%
|
2831 |
92.86%
|
|
|
|
10891 - Game of Sum | 10944 |
59.40%
|
3174 |
92.44%
|
|
|
|
11450 - Wedding shopping | 19765 |
54.35%
|
6809 |
91.29%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |


