Basic Complete Search

Author: Darren Yao

An easy example: iterating through all pairs.

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

Source	Problem Name	Difficulty	Tags	Solution
Bronze	Milk Pails	Easy	Show Tags Complete Search	Internal Sol
Bronze	Diamond Collector	Easy	Show Tags Complete Search	Internal Sol
Bronze	Daisy Chains	Easy	Show Tags Complete Search	Internal Sol
Bronze	Cow Gymnastics	Normal	Show Tags Complete Search	Internal Sol
Bronze	Bovine Genomics	Normal	Show Tags Complete Search	External Sol
Bronze	Triangles	Normal	Show Tags Complete Search	Internal Sol
Bronze	Lifeguards	Normal	Show Tags Complete Search	Internal Sol
Bronze	Why Did the Cow Cross the Road II	Normal	Show Tags Complete Search	Internal Sol
Bronze	Guess the Animal	Hard	Show Tags Complete Search	External Sol
Silver	Bovine Genomics	Hard	Show Tags Complete Search	External Sol
Bronze	Load Balancing	Hard	Show Tags Complete Search	Internal Sol
Bronze	Contaminated Milk	Very Hard	Show Tags Complete Search	Internal Sol
Bronze	Cowntact Tracing	Very Hard	Show Tags Complete Search	External Sol
Bronze	Bull in a China Shop	Very Hard	Show Tags Complete Search	External Sol
Silver	Load Balancing	Very Hard	Show Tags Complete Search	Internal Sol

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!

Join Forum

Basic Complete Search

Problems

Module Progress:Not Started

Join the USACO Forum!

Module Progress: