Judging the Southeast Region

Here’s a video that introduces the ACM International Collegiate Programming Contest (ICPC), and in particular, the Southeast USA Region.

You can download it as a 2G mp4 file (If your browser plays it automatically, then right-click the link and “Save Link As…”)

Or, you can stream it from FIT

You’ll want to watch in full-screen mode. There’s a screen capture segment in the middle that you won’t be able to read otherwise.

Here are the statements of the 2016 NAIPC.

And, here is the data and judges’ reference solutions (Submissions/Solutions are for Invitational Division only):

Click this link for a video of me discussing the problems from the 2015 Southeast USA Regional Programming Contest.

Here are the slides: ACM SEUSA Regional Problems 2015

Here are the statements of the SER 2015 Problems D1.

And, here is the data and judges’ reference solutions:

Here are the statements of the SER 2015 Problems D2.

And, here is the data and judges’ reference solutions:

Here are the statements of the 2015 NAIPC Problems.

And, here is the data and judges’ reference solutions. There were two divisions, Invitational (Inv), and Open (Opn). Also, the next day, the Russian Open Cup (Cup) series of contests used this problem set for their Grand Prix of America.

You can check out the results of the NAIPC and Open Cup contests.

Here are the statements of the SER 2014 D1 Problems.

And, here is the data and judges’ reference solutions:

Here are the statements of the SER 2014 D2 Problems.

And, here is the data and judges’ reference solutions:

Here are the statements of the NAIPC 2014 Problems.

And, here is the data and judges’ reference solutions:

Here’s the judge data for the 2014 NAIPC. It’s password-protected.

data

Here it is – the 2013 Southeast USA Regional Division 1 problem set. You can download the text from here.

Note: For security reasons, the blog won’t upload files with a “.py” extension. The Python programs have extension “.txt”, which will need to be changed to “.py”

Here it is – the 2013 Southeast USA Regional Division 2 problem set. You can download the text from here.

Note: For security reasons, the blog won’t upload files with a “.py” extension. The Python programs have extension “.txt”, which will need to be changed to “.py”

Here it is – the 2013 UChicago Invitational problem set. You can download the text from here.

A Russian contest is going to use this problem set in about a week, so we can’t post the data to the public just yet. I’ll post the usual problem breakdown in about a week, but for now, here’s the problem set & data for the UChicago 2013 Invitational contest. The data is encrypted and password protected, so that only participants can see it.

Problem set: UChicago Invitational 2012 Problem Set

Data: data

Here it is – the 2012 Division II problem set. You can download the text from here.

Here it is – the 2012 Division I problem set. You can download the text from here.

This post is for general discussion of the organization of the North American Super-Region, and questions of how the super-regional organization might be changed to encourage more participation, give more teams a next-level contest experience, and improve North American performance.

Here it is – the problem set. You can download the text from here.

Here is a video of a webcast of the Chief Judge (me) discussing each of the problems in the 2011 problem set. The original lecture was given at Georgia Tech on Thursday, 11 November. The video is about 90 minutes long. The real content starts at about the 2 minute mark.

In the problem statement for Vive la Difference, we make the claim that if all four numbers are less than 2^n, then it will converge in no more than 3n steps. This PowerPoint presentation outlines a proof.