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 | 71178 |
25.48%
|
12845 |
72.78%
|
|
![]() |
473 - Raucous Rockers | 5280 |
27.48%
|
940 |
75.32%
|
|
![]() |
607 - Scheduling Lectures | 7820 |
27.75%
|
1681 |
65.85%
|
|
![]() |
10003 - Cutting Sticks | 58623 |
48.54%
|
15338 |
90.00%
|
|
![]() |
10337 - Flight Planner | 6685 |
50.99%
|
2812 |
92.89%
|
|
![]() |
10891 - Game of Sum | 10807 |
59.45%
|
3149 |
92.44%
|
|
![]() |
11450 - Wedding shopping | 19381 |
54.33%
|
6733 |
91.39%
|
<< Start < Prev 1 Next > End >> | ||
Display # | Results 1 - 7 of 7 |