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 | 71451 |
25.56%
|
12912 |
72.85%
|
|
|
|
473 - Raucous Rockers | 5318 |
27.45%
|
950 |
75.37%
|
|
|
|
607 - Scheduling Lectures | 8009 |
27.88%
|
1695 |
66.02%
|
|
|
|
10003 - Cutting Sticks | 60140 |
48.72%
|
15532 |
90.05%
|
|
|
|
10337 - Flight Planner | 6904 |
50.93%
|
2831 |
92.86%
|
|
|
|
10891 - Game of Sum | 10935 |
59.41%
|
3172 |
92.43%
|
|
|
|
11450 - Wedding shopping | 19752 |
54.35%
|
6808 |
91.29%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |