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 | 71441 |
25.55%
|
12909 |
72.84%
|
|
|
|
473 - Raucous Rockers | 5318 |
27.45%
|
950 |
75.37%
|
|
|
|
607 - Scheduling Lectures | 7991 |
27.86%
|
1692 |
65.96%
|
|
|
|
10003 - Cutting Sticks | 60054 |
48.69%
|
15530 |
90.05%
|
|
|
|
10337 - Flight Planner | 6900 |
50.91%
|
2830 |
92.86%
|
|
|
|
10891 - Game of Sum | 10929 |
59.41%
|
3171 |
92.43%
|
|
|
|
11450 - Wedding shopping | 19743 |
54.36%
|
6807 |
91.29%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |


