Browse Problems 
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
Contribute
Bitcoin:
1ojudgeapLUjJcnUm
ze67a4w3TJ6WnPxo
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 | 71599 |
25.59%
|
12938 |
72.88%
|
|
|
|
473 - Raucous Rockers | 5326 |
27.49%
|
952 |
75.42%
|
|
|
|
607 - Scheduling Lectures | 8053 |
27.95%
|
1700 |
66.06%
|
|
|
|
10003 - Cutting Sticks | 60821 |
48.75%
|
15615 |
90.04%
|
|
|
|
10337 - Flight Planner | 6918 |
50.94%
|
2834 |
92.87%
|
|
|
|
10891 - Game of Sum | 10996 |
59.43%
|
3184 |
92.46%
|
|
|
|
11450 - Wedding shopping | 19954 |
54.40%
|
6834 |
91.31%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |