Competition Gold Course

Grade 9 - 12  |  Java or Python required

 

The United States of America Computing Olympiad (USACO) is a computer programming competition that takes place in the winter every year. This course teaches advanced graph algorithms and dynamic programming that are needed to succeed in USACO Gold. 

Subcourses & Curriculum

Competition Gold

Algorithms
This course primarily teaches advanced graph algorithms and dynamic programming that are needed for USACO Gold. 
  • Introduction to USACO Gold
  • Topological Sort
  • Knapsack
  • Segment Tree
  • Lazy Propagation
  • Fenwick Tree (BIT)
  • Minimum Spanning Tree
  • Floyd-Warshall
  • Disjoin Set (Union Find)
  • Line Intersection
  • Point in Polygon

Learning Outcome

 

Upon completion students will be able to solve mid-level USACO Gold problems and get ready to participate in the USACO Gold contest. 

Pre-requisite

 

Students who passed the USACO Silver contest or completed our USACO Silver Course.  Evaluation is needed to join this course. Please contact us to schedule a free evaluation.

Tel: 949.409.1341

Address: 810 Roosevelt, Irvine, CA 92620

© 2020 by BTree Education, LLC. All Rights Reserved.