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 | 71530 |
25.58%
|
12929 |
72.87%
|
|
|
|
473 - Raucous Rockers | 5320 |
27.48%
|
952 |
75.42%
|
|
|
|
607 - Scheduling Lectures | 8034 |
27.94%
|
1698 |
66.08%
|
|
|
|
10003 - Cutting Sticks | 60581 |
48.76%
|
15585 |
90.04%
|
|
|
|
10337 - Flight Planner | 6912 |
50.91%
|
2831 |
92.86%
|
|
|
|
10891 - Game of Sum | 10970 |
59.43%
|
3181 |
92.46%
|
|
|
|
11450 - Wedding shopping | 19870 |
54.37%
|
6822 |
91.29%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |


