Adding Solutions

Basic Debugging

Choosing a Language

Contest Strategy

Contests

Contributing

C++ With the Command Line

Data Types

How to Debug

Debugging C++

Expected Knowledge

Fast Input & Output

(Optional) C++ - Writing Generic Code

Input & Output

Introduction to Competitive Programming

(Optional) C++ - Lambda Expressions

Resources: Learning to Code

Introducing Modules

Olympiads

How to Practice

Resources: Competitive Programming

Resources: USA-Specific

Running Code Locally

Running Code Online

USACO Camp

USACO FAQs

USACO Monthlies

Using This Guide

Working With MDX

Ad Hoc Problems

Casework

Complete Search with Recursion

Additional Practice for USACO Bronze

Basic Complete Search

Introduction to Data Structures

Introduction to Graphs

Introduction to Greedy Algorithms

Introduction to Sets & Maps

Introduction to Sorting

Rectangle Geometry

Simulation

Time Complexity

Binary Search

Binary Search on a Sorted Array

Additional Practice for USACO Silver

Flood Fill

Introduction to Functional Graphs

Graph Traversal

Greedy Algorithms with Sorting

Intro to Bitwise Operators

Introduction to Tree Algorithms

More on Prefix Sums

Introduction to Prefix Sums

Priority Queues

Custom Comparators and Coordinate Compression

Two Pointers

DP on Trees - Solving For All Roots

Combinatorics

Additional Practice for USACO Gold

(Optional) Sorted Sets with Custom Comparators

Bitmask DP

Range DP

DP on Trees - Introduction

Disjoint Set Union

Digit DP

Divisibility

Hashing

(Optional) Hashmaps

Introduction to DP

More Operations on Sorted Sets

Knapsack DP

(Optional) LCA with Euler Tour

Longest Increasing Subsequence

Minimum Spanning Trees

(Optional) Meet In The Middle

Modular Arithmetic

Point Update Range Sum

Paths on Grids

Shortest Paths with Non-Negative Edge Weights

Sliding Window

Stacks

Optimizing Unimodal Functions

Topological Sort

(Optional) Euler Tour Technique

Shortest Paths with Unweighted Edges

2D Range Queries

Binary Jumping

(Optional) Bitsets

Centroid Decomposition

Additional Practice for USACO Platinum

Convex Hull

Convex Hull Trick

Divide & Conquer - DP

Divide & Conquer - SRQ

Sum over Subsets DP

Geometry Primitives

Heavy-Light Decomposition

Matrix Exponentiation

Small-To-Large Merging

Inclusion-Exclusion Principle

"use strict";
const {Fragment: _Fragment, jsx: _jsx, jsxs: _jsxs} = arguments[0];
const frontmatter = undefined;
function _createMdxContent(props) {
  const _components = {
    a: "a",
    h2: "h2",
    p: "p",
    strong: "strong",
    ...props.components
  }, {Asterisk, HeaderLink, Problems} = _components;
  if (!Asterisk) _missingMdxReference("Asterisk", true);
  if (!HeaderLink) _missingMdxReference("HeaderLink", true);
  if (!Problems) _missingMdxReference("Problems", true);
  return _jsxs(_Fragment, {
    children: [_jsxs(_components.h2, {
      id: "what-now",
      children: [_jsx(_components.a, {
        "aria-hidden": "true",
        tabIndex: "-1",
        className: "anchor before",
        href: "#what-now",
        children: _jsx(HeaderLink, {})
      }), "What Now?"]
    }), "\n", _jsxs(_components.p, {
      children: ["After completing this section on the USACO Guide, you should be comfortable with\nthe topics that have historically appeared in the USACO Silver\ndivision.", _jsx(Asterisk, {
        children: "Of course, there's always a chance that another topic,\npotentially from a higher division, will show up in future Silver\ncontests."
      }), " In order to maximize your chance at promoting, you should\naim to ", _jsx(_components.strong, {
        children: "practice"
      }), " by doing more problems."]
    }), "\n", _jsxs(_components.h2, {
      id: "uncategorized-problems",
      children: [_jsx(_components.a, {
        "aria-hidden": "true",
        tabIndex: "-1",
        className: "anchor before",
        href: "#uncategorized-problems",
        children: _jsx(HeaderLink, {})
      }), "Uncategorized Problems"]
    }), "\n", _jsxs(_components.p, {
      children: ["Below we list some problems that we think are roughly Silver level but don't\nreally fit in previous modules.", _jsx(Asterisk, {
        children: "either because there were too many\nproblems already, or because the problem requires more than one\nconcept"
      }), " The difficulties listed here are relative to the Silver\ndivision (difficulty is subjective and isn't always accurate though). Some of\nthese problems appeared in a higher division, but can still be solved using only\nSilver-level topics. We'll be expanding this list as we get more problem\nsuggestions."]
    }), "\n", _jsx(Problems, {
      problems: "problems",
      pageSize: 12
    }), "\n", _jsxs(_components.h2, {
      id: "final-thoughts",
      children: [_jsx(_components.a, {
        "aria-hidden": "true",
        tabIndex: "-1",
        className: "anchor before",
        href: "#final-thoughts",
        children: _jsx(HeaderLink, {})
      }), "Final Thoughts"]
    }), "\n", _jsxs(_components.p, {
      children: ["Refer to our FAQ to\n", _jsx(_components.a, {
        href: "/general/usaco-faq#q-where-can-i-find-more-practice-problems",
        children: "find more problems to practice"
      }), ".\nYou may also find the ", _jsx(_components.a, {
        href: "/general/practicing",
        children: "How to Practice"
      }), "\nmodule worth reading. Best of luck on future contests!"]
    })]
  });
}
function MDXContent(props = {}) {
  const {wrapper: MDXLayout} = props.components || ({});
  return MDXLayout ? _jsx(MDXLayout, {
    ...props,
    children: _jsx(_createMdxContent, {
      ...props
    })
  }) : _createMdxContent(props);
}
return {
  frontmatter,
  default: MDXContent
};
function _missingMdxReference(id, component) {
  throw new Error("Expected " + (component ? "component" : "object") + " `" + id + "` to be defined: you likely forgot to import, pass, or provide it.");
}


Final tips for Silver and additional practice problems.

Asterisk

problems

pageSize

Problems

Spying On The Beaver

Range XOR Queries

Mixing Water

2012 - Job Scheduling

Magazine Ad

Cutting Out

Graph Composition

Restore Graph

 Building an Aquarium

All Manhattan Distances

Kites

2010 - Traffic

Moamen and k-subarrays

Matching

Maximum Manhattan Distances

Save the Nature

Pond

Firehose

Circular Barn

Sabotage

Firecrackers

Just Green Enough

Min Max Sort

Three Base Stations

To Become Max

Big Brush

Replace the Numbers

Friendly Spiders

Counting Rectangles

Count the Trains

Array and Segments

Set Or Decrease

Adjust The Presentation

Medium Demon Problem (easy version)

Medium Demon Problem (hard version)

Medical Parity

Salary Changing

Escape Room

Phenomenal Reviews

2017 - Sabotage

Split Into Two Sets

Giving Awards

Trapmigiano Reggiano

Robot Queries

Hypercarp and Interdimensional Jumps

Round Dance

Mahmoud & Ehab & Function

Ammar-utiful Array

Preparing for Merge Sort

Minimizing Difference

Far Cities

Dima and Containers

Connecting Universities

Minimax Problem

Fennec VS. Snuke

Eating

2013 - Dreaming

Red Light, Green Light (Hard Version)

Bear and Forgotten Tree 2

Busy Beaver

Tree Compass

Carrots for rabbits

Lane Switching

2011 - Table Coloring

Load Balancing

Source	Problem Name	Difficulty	Tags
CF	Spying On The Beaver	Easy	Show Tags Greedy, Tree
CSES	Range XOR Queries	Easy	Show Tags Prefix Sums
CF	Mixing Water	Easy	Show Tags Binary Search
CEOI	2012 - Job Scheduling	Easy	Show Tags Binary Search
CF	Magazine Ad	Easy	Show Tags Binary Search, Greedy, Two Pointers
CF	Cutting Out	Easy	Show Tags Binary Search
CF	Graph Composition	Easy	Show Tags Connected Components, DSU
CF	Restore Graph	Easy	Show Tags BFS
CF	Building an Aquarium	Easy	Show Tags Binary Search
CSES	All Manhattan Distances	Easy	Show Tags Sorting
CF	Kites	Easy	Show Tags Prefix Sums
IOI	2010 - Traffic	Easy	Show Tags Tree

Table of Contents

Table of Contents

What Now?

Uncategorized Problems

Final Thoughts

Module Progress:

Join the USACO Forum!