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 | 71333 |
25.51%
|
12881 |
72.80%
|
|
![]() |
473 - Raucous Rockers | 5312 |
27.43%
|
946 |
75.37%
|
|
![]() |
607 - Scheduling Lectures | 7900 |
27.80%
|
1684 |
65.91%
|
|
![]() |
10003 - Cutting Sticks | 59162 |
48.61%
|
15439 |
90.03%
|
|
![]() |
10337 - Flight Planner | 6872 |
50.93%
|
2827 |
92.89%
|
|
![]() |
10891 - Game of Sum | 10916 |
59.39%
|
3166 |
92.45%
|
|
![]() |
11450 - Wedding shopping | 19564 |
54.31%
|
6775 |
91.32%
|
<< Start < Prev 1 Next > End >> | ||
Display # | Results 1 - 7 of 7 |