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 | 70386 |
25.35%
|
12719 |
72.64%
|
||
473 - Raucous Rockers | 5156 |
27.70%
|
918 |
75.05%
|
||
607 - Scheduling Lectures | 7617 |
27.40%
|
1674 |
65.77%
|
||
10003 - Cutting Sticks | 56544 |
48.48%
|
15068 |
90.00%
|
||
10337 - Flight Planner | 6576 |
51.34%
|
2797 |
92.85%
|
||
10891 - Game of Sum | 10579 |
59.53%
|
3102 |
92.42%
|
||
11450 - Wedding shopping | 18585 |
54.36%
|
6612 |
91.35%
|
<< Start < Prev 1 Next > End >> | ||
Display # | Results 1 - 7 of 7 |