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 | 70364 |
25.35%
|
12717 |
72.64%
|
|
|
|
473 - Raucous Rockers | 5146 |
27.71%
|
917 |
75.03%
|
|
|
|
607 - Scheduling Lectures | 7615 |
27.39%
|
1674 |
65.77%
|
|
|
|
10003 - Cutting Sticks | 56472 |
48.47%
|
15054 |
90.00%
|
|
|
|
10337 - Flight Planner | 6572 |
51.34%
|
2797 |
92.85%
|
|
|
|
10891 - Game of Sum | 10572 |
59.52%
|
3099 |
92.45%
|
|
|
|
11450 - Wedding shopping | 18555 |
54.40%
|
6609 |
91.35%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |