PrevNext
Very Frequent
 0/17

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
6 - Complete Search

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.

Maximum Distance
CF - Easy

Focus Problem – read through this problem before continuing!

Solution

Problems

StatusSourceProblem NameDifficultyTags
Bronze
Milk Pails
Easy
Show TagsComplete Search
Bronze
Diamond Collector
Easy
Show TagsComplete Search
Bronze
Daisy Chains
Easy
Show TagsComplete Search
Bronze
Cow Gymnastics
Normal
Show TagsComplete Search
Bronze
Bovine Genomics
Normal
Show TagsComplete Search
Bronze
Triangles
Normal
Show TagsComplete Search
Bronze
Lifeguards
Normal
Show TagsComplete Search
Bronze
Why Did the Cow Cross the Road II
Normal
Show TagsComplete Search
Bronze
Guess the Animal
Hard
Show TagsComplete Search
Silver
Bovine Genomics
Hard
Show TagsComplete Search
Bronze
Load Balancing
Hard
Show TagsComplete Search
Bronze
Sleeping in Class
Hard
Show TagsComplete Search
Bronze
Contaminated Milk
Very Hard
Show TagsComplete Search
Bronze
Cowntact Tracing
Very Hard
Show TagsComplete Search
Bronze
Bull in a China Shop
Very Hard
Show TagsComplete Search
Silver
Load Balancing
Very Hard
Show TagsComplete Search

Module Progress:

PrevNext