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 | 71424 |
25.55%
|
12906 |
72.83%
|
|
|
|
473 - Raucous Rockers | 5317 |
27.44%
|
949 |
75.34%
|
|
|
|
607 - Scheduling Lectures | 7986 |
27.84%
|
1691 |
65.94%
|
|
|
|
10003 - Cutting Sticks | 59909 |
48.65%
|
15510 |
90.05%
|
|
|
|
10337 - Flight Planner | 6899 |
50.91%
|
2829 |
92.86%
|
|
|
|
10891 - Game of Sum | 10921 |
59.40%
|
3168 |
92.42%
|
|
|
|
11450 - Wedding shopping | 19730 |
54.37%
|
6802 |
91.33%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |