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 | 71342 |
25.52%
|
12886 |
72.82%
|
|
|
|
473 - Raucous Rockers | 5312 |
27.43%
|
946 |
75.37%
|
|
|
|
607 - Scheduling Lectures | 7900 |
27.80%
|
1684 |
65.91%
|
|
|
|
10003 - Cutting Sticks | 59366 |
48.59%
|
15449 |
90.03%
|
|
|
|
10337 - Flight Planner | 6893 |
50.94%
|
2828 |
92.89%
|
|
|
|
10891 - Game of Sum | 10916 |
59.39%
|
3166 |
92.45%
|
|
|
|
11450 - Wedding shopping | 19587 |
54.30%
|
6780 |
91.31%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 7 of 7 | |