PrevNext
Very Frequent
 0/16

Basic Complete Search

Authors: Darren Yao, Dong Liu

Contributors: Brad Ma, Nathan Gong

An easy example: iterating through all pairs.

Edit This Page

Resources
IUSACO

module is based off this


In many problems (especially in Bronze) it suffices to check all possible cases in the solution space, whether it be all elements, all pairs of elements, or all subsets, or all permutations. Unsurprisingly, this is called complete search (or brute force), because it completely searches the entire solution space.

Focus Problem – read through this problem before continuing!

Solution

Problems

StatusSourceProblem NameDifficultyTags
BronzeEasy
Show TagsComplete Search
BronzeEasy
Show TagsComplete Search
BronzeEasy
Show TagsComplete Search
BronzeNormal
Show TagsComplete Search
BronzeNormal
Show TagsComplete Search
BronzeNormal
Show TagsComplete Search
BronzeNormal
Show TagsComplete Search
BronzeNormal
Show TagsComplete Search
BronzeHard
Show TagsComplete Search
SilverHard
Show TagsComplete Search
BronzeHard
Show TagsComplete Search
BronzeVery Hard
Show TagsComplete Search
BronzeVery Hard
Show TagsComplete Search
BronzeVery Hard
Show TagsComplete Search
SilverVery Hard
Show TagsComplete Search

Module Progress:

Join the USACO Forum!

Stuck on a problem, or don't understand a module? Join the USACO Forum and get help from other competitive programmers!

PrevNext