2014 ACM-ICPC North America Qualification Contest

This page was last updated September 29, 2014 at 10:09 (America/Chicago).

The third ACM-ICPC North America Qualification Contest was held on September 27, 2014 from 2:00-7:00 PM Central Time (see this page for the time in your time zone).

The North America Qualifier is an online (distributed) programming contest, offered as a drop-in replacement for so-called "qualifying" contests (e.g. school-level, pre-regional competitions).

Contest summary

There were 11 problems given. Here are the problem statements and the Judge's test data.

You can try out the problems on Open Kattis. If you don't have an account, you can create one for free. Here are direct links to the problems:

  1. Eight Queens
  2. Color Walk
  3. Flexible Spaces
  4. Flip Five
  5. Human Cannonball Run
  6. Mixed Fractions
  7. Pesky Mosquitoes
  8. Narrow Art Gallery
  9. Tractor
  10. Units
  11. Yikes -- Bikes!

We had 679 teams sign in today, and 636 teams solve something -- that's 93.6% of teams that signed in solving something. There were 6538 total submissions over 5 hours, which is 21.8 submissions per minute on average.

Here is a distribution of the number of problems solved by teams (which includes some teams that did not show up):

PROBLEMS SOLVED 0 1 2 3 4 5 6 7 8 9 10 11
#TEAMS 387 79 127 182 75 52 29 23 22 25 15 7

Here is a distribution over how often each problem was solved:

A (8queens) B (colorwalk) C (flexible) D (flipfive) E (humancannonball) F (mixedfractions) G (mosquitoes) H (narrowartgallery) I (tractor) J (units) K (yikes)
Solved / Tries 434/1617 (26%) 9/55 (16%) 541/864 (62%) 212/425 (49%) 111/199 (55%) 626/956 (65%) 65/263 (24%) 124/368 (33%) 117/686 (17%) 135/252 (53%) 28/333 (8%)
Average tries 2.83 3.06 1.47 1.60 1.53 1.46 2.31 1.93 2.33 1.49 3.30
Averages tries to solve 2.66 2.33 1.33 1.42 1.37 1.37 2.09 1.67 1.99 1.30 2.50


With a large contest like this, many hands make light work. Thank you very much to everyone who contributed to this contest:


Registration is now closed. If you (as a coach) have registered teams on icpc.baylor.edu for the North America Qualifier, then you are done. If you have missed registration, we apologize but no additional teams may be registered at this point due to time constraints.

Basic details

Contest scoring

This contest scoring system will be the same as the world finals. That is, the winner is the team solving the most problems. If two teams solve the same number of problems, then the team with the lowest time is the winner. If two teams have the same time the submission time of the last solved problem is used as a tie-breaker.

The time is the sum of the time of submission (in minutes) of the earliest correct submission for each solved problem, plus any penalty minutes for each incorrect submission of a problem prior to solving that problem. Penalties are 20 minutes for any of the following reasons:

Compile error does not incur a penalty; it is not considered a valid submission. Illegal Function does not incur a penalty, but any illegal function will be investigated and a team may be disqualified from the competition if the judges consider the program an attempt to exploit the contest system.

For more information on how Kattis scores problems, please see Kattis documentation.

For problem-writers

We are using the Kattis Problem Package format for developing problems. Here is a guide to developing problems for this format.

Primary contact: Greg Hamerly