- Aaeria - Eric Pei, Andrew Qi Tang, Victor Gao - 2600
- tempester04 - Elijah Huang, Ethan Peng, Justin Wu - 2300
- canihasstdio - tuzepoito, cup_of_tea, yann_dev - 2200
- echen333us - Edward Chen, Anish Rajeev, Sahil Parikh - 1800
- zoember - Aaron Liu - 1800
- Vandegrift_1_A - Andrew McAlinden, Jasper Lee, Rohit Alamgari - 1700
- A88-McNeilHS - Jessica Shoemaker, Aditya Patwardhan - 1500
- TeamBlueberries - Hanyu Wei, Ishan Dasgupta, Kevin Yu - 1500
- jim231 - Jewon Im, Ryan Kim - 1300
- jakedude18 - Jake Kerrigan - 600

The Westlake High School Competitive Programming Tournament (WHS-CPT) is an annual computer science competition held at Westlake. WHS-CPT 2021 will be held online using the HackerRank platform. There will be one division containing a fair share of both beginner and advanced problems. For any questions go to this Google Form

If you are not registered already, you can do so here.

Thanks to a generous donation from our sponsor Wolfram Research, we are able to provide one year of Wolfram Alpha Pro and Wolfram One (worth over $300) to **each person on our top 7 advanced teams and our top 3 novice teams** as well as **1 randomly drawn team.**

For those wanting to learn more about Wolfram’s intiatives and how their products can be used in all things technical, check out their website here!

Here are several sample topics (without the problem statement). Some of these may appear in the contest!

If you are looking to study for this contest, we strongly recommend checking out past USACO problems.

- ASCII art (output).
- Given a set of integers, determine the largest number in the set that is smaller than
`n`

(control statements). - Is the current day a leap year? (modulus)

- Find the shortest path given a directed graph (Dijkstra’s).
- Given a list of numbers, sort the numbers by their absolute value, and then place the positive numbers before the negative numbers (Sorting).
- Given endpoints of “carpet layers,” with form
`[a, b]`

determine the number of layers of carpet at any point`p`

(prefix sums). - Print all the shortest paths from a 3d point
`a,b,c`

to`d,e,f`

(breadth first search).

- Given a set of P discrete points, find a triangulation such that no point in P is inside the circumcircle of any triangle in the triangulation of P (Delaunay Triangulation).
- Find the maximum distance between any two points in O(nlogn) time (Divide and Conquer).
- Calculate the polygon area if the lower hull were to be separated from the upper hull by a distance of
`n`

(Andrew’s Monotone Chain).

Using Wolfram to speed up the problem solving process

Competitive Programmer’s Handbook

*Q:* What is the registration fee?

*A:* This contest is free :)

*Q:* How many people can be on a team?

*A:* 1-3 people

*Q:* What is the problem difficulty?

*A:* There are several samples, although the easiest problems are almost the same as standard computer science labs while the harder ones can range up to USACO platinum difficulty.

*Q:* What if we come across an issue during the contest?

*A:* There will be a zoom room open for you to resolve any issues within the contest (and we will post any announcements through the provided notification system).