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 3: The New Lower Bound of Programming Contests (Steven & Felix Halim) :: Problem Solving Paradigms :: Dynamic Programming :: Traveling Salesman Problem (TSP)
| Title | Total Submissions / Solving % | Total Users / Solving % | ||||
|
216 - Getting in Line | 17756 |
44.00%
|
5202 |
83.37%
|
|
|
10496 - Collecting Beepers | 10865 |
59.87%
|
4128 |
93.60%
|
|
|
|
11284 - Shopping Trip | 6514 |
25.56%
|
1118 |
83.99%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 3 of 3 | |