铜牌

Time Complexity

Measuring the number of operations an algorithm performs.

Introduction to Data Structures

What a data structure is, (dynamic) arrays, pairs, and tuples.

Simulation

Somewhat Frequent

Directly simulating the problem statement.

Basic Complete Search

Very Frequent

Problems involving iterating through the entire solution space.

Complete Search with Recursion

Not Frequent

Harder problems involving iterating through the entire solution space, including those that require generating subsets and permutations.

Introduction to Sorting

Not Frequent

Arranging collections in increasing order.

Introduction to Sets & Maps

Somewhat Frequent

Maintaining collections of distinct elements/keys with sets and maps.

Casework

Not Frequent

Dividing into multiple cases and solving for each one separately.

Introduction to Greedy Algorithms

Very Frequent

Problems that can be solved by selecting the choice that seems to be the best at the moment at every step.

Introduction to Graphs

Rare

What graphs are.

Rectangle Geometry

Rare

Problems involving rectangles whose sides are parallel to the coordinate axes.

Ad Hoc Problems

Very Frequent

Problems that do not fall into standard categories with well-studied solutions.

Additional Practice for USACO Bronze

Final tips for Bronze and additional practice problems.