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
Browse Problems
Root :: Competitive Programming: Increasing the Lower Bound of Programming Contests (Steven & Felix Halim) :: Chapter 3. Problem Solving Paradigms :: Complete Search :: Recursive Backtracking
| Title | Total Submissions / Solving % | Total Users / Solving % | ||||
|
|
193 - Graph Coloring | 24755 |
28.53%
|
5920 |
71.10%
|
|
|
|
222 - Budget Travel | 4915 |
35.04%
|
1454 |
76.82%
|
|
|
|
524 - Prime Ring Problem | 83952 |
29.02%
|
13266 |
78.97%
|
|
|
|
624 - CD | 51374 |
46.70%
|
11562 |
89.73%
|
|
|
|
628 - Passwords | 11972 |
58.92%
|
3973 |
90.64%
|
|
|
|
729 - The Hamming Distance Problem | 27592 |
38.90%
|
7140 |
82.59%
|
|
|
|
750 - 8 Queens Chess Problem | 44306 |
25.78%
|
8550 |
73.53%
|
|
|
|
10285 - Longest Run on a Snowboard | 16114 |
58.45%
|
5564 |
94.19%
|
|
|
|
10496 - Collecting Beepers | 11142 |
59.99%
|
4165 |
93.59%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 9 of 9 | |


