Complete search: enumerating candidate solutions · 2 of 3
Brute force
Shrink a search written as nested loops by computing one choice from the others, or by looping over the possible answers instead of the input.
- 枚举 (Enumeration) Three points to settle before enumerating (the candidates, how to cut their number, the order to try them in), with a pair search that is shortened step by step. oi-wiki.org (opens in a new tab)
- Basic Complete Search The problem list at the end of the module is practice for searches written as nested loops. usaco.guide (opens in a new tab)