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 | 71247 |
25.49%
|
12860 |
72.79%
|
|
|
|
473 - Raucous Rockers | 5280 |
27.48%
|
940 |
75.32%
|
|
|
|
607 - Scheduling Lectures | 7841 |
27.73%
|
1681 |
65.85%
|
|
|
|
10003 - Cutting Sticks | 58769 |
48.57%
|
15365 |
90.00%
|
|
|
|
10337 - Flight Planner | 6690 |
51.03%
|
2815 |
92.90%
|
|
|
|
10891 - Game of Sum | 10848 |
59.46%
|
3153 |
92.42%
|
|
|
|
11450 - Wedding shopping | 19421 |
54.32%
|
6747 |
91.34%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |