| ID | NAME | QUALITY | USERS | ACC % | DIFFICULTY C I |
|---|---|---|---|---|---|
| 37444 | Anti Hash II | 1 | 7 |
|
|
| 36653 | Blind Escape II | 3 | 8 |
|
|
| 36671 | Bipartite Permutation (Hard) | 6 | 51 |
|
|
| 28609 | Boat Burglary | 15 | 115 |
|
|
| 33372 | Lannister Army | 11 | 334 |
|
|
| 21457 | House Fence | 5 | 143 |
|
#divide-and-conquer
Divide and conquer is an algorithm design paradigm based on multi-branched recursion. It works by recursively breaking down a problem into two or more sub-problems of the same (or related) type (divide), until these become simple enough to be solved directly (conquer
https://en.wikipedia.org/wiki/Divide_and_conquer_algorithms
RSS