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 | 71304 |
25.50%
|
12874 |
72.80%
|
|
|
|
473 - Raucous Rockers | 5312 |
27.43%
|
946 |
75.37%
|
|
|
|
607 - Scheduling Lectures | 7859 |
27.74%
|
1684 |
65.91%
|
|
|
|
10003 - Cutting Sticks | 58996 |
48.62%
|
15411 |
90.02%
|
|
|
|
10337 - Flight Planner | 6826 |
51.13%
|
2820 |
92.91%
|
|
|
|
10891 - Game of Sum | 10911 |
59.38%
|
3164 |
92.45%
|
|
|
|
11450 - Wedding shopping | 19509 |
54.32%
|
6765 |
91.31%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |