Here are the statements of the 2016 NAIPC.
And, here is the data and judges’ reference solutions (Submissions/Solutions are for Invitational Division only):
Here are the statements of the 2016 NAIPC.
And, here is the data and judges’ reference solutions (Submissions/Solutions are for Invitational Division only):
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:
Problem  Judge Data  Solutions  

Airports




Checkers




Coverage




Gears




Grid




Hilbert Sort




The Magical 3




Racing Gems




Simplicity




Weightlifting



Here are the statements of the SER 2015 Problems D2.
And, here is the data and judges’ reference solutions:
Problem  Judge Data  Solutions  

Blur




A Classy Problem




Egg Drop




Excellence




Grid




Hilbert Sort




The Magical 3




Persistence




Simplicity




Triangles




Xedni Drawkcab



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.
Problem  Judge Data  Solutions  

A: Area of Effect




B: Canyon Mapping




C: Magic Checkerboard




D: Extensive Or




E: Primal Partitions




F: Sand Art




G: String Stretching




H: Vending Machine




I: Rainbow Zamboni




J: Zig Zag Nametag



Here are the statements of the SER 2014 D1 Problems.
And, here is the data and judges’ reference solutions:
Problem  Judge Data  Solutions  

A: Alchemy




B: Stained Carpet




C: Containment




D: Gold Leaf




E: Hill Number




F: Knights




G: Word Ladder




H: Shuffles




I: Stamp Stamp



Here are the statements of the SER 2014 D2 Problems.
And, here is the data and judges’ reference solutions:
Problem  Judge Data  Solutions  

A: Stained Carpet




B: Gold Leaf




C: Hill Number




D: Knight Moves




E: Marble Madness




F: Polling




G: Runes




H: Shuffles




I: Top 25



Here are the statements of the NAIPC 2014 Problems.
And, here is the data and judges’ reference solutions:
Problem  Judge Data  Solutions  

A: Banjo




B: Cheats




C: Diplomacy




D: Fantastic Problem




E: GCDs




F: Gold Bandits




G: Integer Estate Agent




H: Reconnaissance




I: Super Mario 169




J: Two Knights’ Poem



Here’s the judge data for the 2014 NAIPC. It’s passwordprotected.
Here it is – the 2013 Southeast USA Regional Division 1 problem set. You can download the text from here.
Problem  Judge Data  Solutions  

A: Beautiful Mountains




B: Nested Palindromes




C: Ping!




D: Electric Car Rally




E: Skyscrapers




F: Star Simulations




G: Tandem Repeats




H: Triangles




I: It Takes a Village




J: You Win!



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.
Problem  Judge Data  Solutions  

A: Cut the Cake




B: The n Days of Christmas




C: Ping!




D: Electric Car Rally




E: Count your Cousins




F: Decimal Representation




G: Politics




H: Perfect Shuffle




I: Speed Can Cost You




J: Text Roll



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.
Problem  Judge Data  Solutions  

A: Winter Roads




B: Can of Worms




C: Automatic Trading




D: 3D Printer




E: Flooding Fields




F: Goat Ropes




G: Job Postings




H: Overlapping Maps




I: Unreal Estate




J: Satisfaction Guaranteed




K: Uniform Subtrees



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.
Problem  Judge Data  Solutions  

A: Candy Store




B: Collision Detection




C: Do It Wrong, Get It Right




D: Dueling Philosophers




E: Paint Me




F: Party Games




G: Reverse Nonogram




H:Tsunami




I: Unhappy Numbers




J: Walls



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

A: Candy Store




B: Collision Detection




C: Component Testing




D: Do It Wrong, Get It Right




E: Funhouse




F: A Terribly Grimm Problem




G: Heads or Tails




H:Tsunami




I: Unhappy Numbers




J: Walls



This post is for general discussion of the organization of the North American SuperRegion, and questions of how the superregional organization might be changed to encourage more participation, give more teams a nextlevel contest experience, and improve North American performance.
Here it is – the problem set. You can download the text from here.
Problem  Judge Data  Solutions  

A: CosmoCraft




B: Covered Walkway




C: Double Dealing




D: The End of the World




E: Estimation




F: Juggler




G: Red/Blue Spanning Tree




H:The Red Gem




I: Science!




J: The Worm in the Apple



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.
Problem  Approximate time it starts 

Sunday Drive  4:00 
Hexagram  9:00 
Flooring Tiles  14:30 
Vive la Difference! (Proof of 3n convergence)  27:00 
Robot Navigation  41:45 
Folding Game  49:45 
Burnout  52:45 
Family Fortune  63:55 
Moving Points  73:00 
Vampire Numbers  81:35 
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.
Here it is – the 2011 problem set. You can download the text from here.
Problem  Judge Data  Solutions  

A: Sunday Drive




B: Hexagram




C: Flooring Tiles




D: Vive la Difference!




E: Robot Navigation




F: Folding Game




G: Burnout




H:Family Fortune




I: Moving Points




J: Vampire Numbers


