The 2021 ICPC North America Division Championships were held on Thursday, 22 April
January 23rd, 2016 | Categories: 2015 Regionals, Problems and Problem Sets
November 14th, 2015 | Categories: 2015 Regionals

Here are the statements of the SER 2015 Problems D1.

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

Problem Judge Data Solutions
Airports

Submissions: 30
Solutions: 2
airports
 airports_vanb.java
Checkers

Submissions: 73
Solutions: 4
checkers
 checkers_vanb.java
Coverage

Submissions: 9
Solutions: 2
coverage
coverage_vanb.java
Gears

Submissions: 28
Solutions: 23
gears
gears_vanb.java
Grid

Submissions: 74
Solutions: 33
grid
 grid_vanb.java
Hilbert Sort

Submissions: 19
Solutions: 7
hilbert
 hilbert_vanb.java
The Magical 3

Submissions: 152
Solutions: 21
magical3
 magical3_vanb.java
Racing Gems

Submissions: 16
Solutions: 4
racinggems
racinggems_vanb.java
Simplicity

Submissions: 73
Solutions: 42
simplicity
 simplicity_vanb.java
Weightlifting

Submissions: 8
Solutions: 1
weightlifting
 weightlifting_vanb.java
November 14th, 2015 | Categories: 2015 Regionals

Here are the statements of the SER 2015 Problems D2.

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

Problem Judge Data Solutions
Blur

Submissions: 28
Solutions: 5
blur
blur_vanb.java
A Classy Problem

Submissions: 36
Solutions: 12
classy
classy_vanb.java
Egg Drop

Submissions: 112
Solutions: 34
eggdrop
eggdrop_vanb.java
Excellence

Submissions: 75
Solutions: 30
excellence
excellence_vanb.java
Grid

Submissions: 15
Solutions: 2
grid
grid_vanb.java
Hilbert Sort

Submissions: 0
Solutions: 0
hilbert
hilbert_vanb.java
The Magical 3

Submissions: 101
Solutions: 2
magical3
magical3_vanb.java
Persistence

Submissions: 59
Solutions: 53
persistence
persistence_vanb.java
Simplicity

Submissions: 140
Solutions: 39
simplicity
simplicity_vanb.java
Triangles

Submissions: 59
Solutions: 35
triangles
triangle_vanb.java
Xedni Drawkcab

Submissions: 81
Solutions: 51
xedni
xedni_vanb.java
April 7th, 2015 | Categories: 2015 NAIPC

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

Inv Opn Cup
Submissions: 11 12 27
Solutions: 1 0 0
areaofeffect
aoe_font.java
aoe_lewin_2.java
B: Canyon Mapping

Inv Opn Cup
Submissions: 1 1 53
Solutions: 0 0 2
canyon
canyon_font.java
canyon_lewin1.java
C: Magic Checkerboard

Inv Opn Cup
Submissions: 165 183 212
Solutions: 23 20 54
checkerboard
checkerboard_font.java
checkerboard_vanb.java
D: Extensive Or

Inv Opn Cup
Submissions: 10 7 34
Solutions: 5 5 25
extensiveor
xor_lewin.java
Xor_rokicki.java
E: Primal Partitions

Inv Opn Cup
Submissions: 108 87 110
Solutions: 25 17 58
primal
primal_fast_vanb.java
primal_font.java
primal_lewin.java
primal_vanb.java
F: Sand Art

Inv Opn Cup
Submissions: 65 40 140
Solutions: 10 6 11
sandart
sandart_font.java
sandart_lewin_flow.java
G: String Stretching

Inv Opn Cup
Submissions: 55 98 135
Solutions: 4 5 25
stretching
string_font.java
string_lewin.java
string_lewin_memo.java
H: Vending Machine

Inv Opn Cup
Submissions: 93 89 141
Solutions: 15 9 38
vending
vending_font.java
VendingMachine.java
I: Rainbow Zamboni

Inv Opn Cup
Submissions: 50 66 52
Solutions: 10 8 20
zamboni
zamboni_darko.java
zamboni_font.java
J: Zig Zag Nametag

Inv Opn Cup
Submissions: 84 165 90
Solutions: 44 58 62
zigzag
zigzag_vanb.java
zigzagnametag_font.java
November 15th, 2014 | Categories: 2014 Regionals

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

Submissions: 1
Solutions: 0
alchemy
alchemy_vanb.java
Alchemy.java
AlchemyAN.java
AlchemyTR.cpp
B: Stained Carpet

Submissions: 62
Solutions: 4
carpet
carpet_vanb.java
StainedCarpet_constant1_artur.java
C: Containment

Submissions: 36
Solutions: 4
containment
containment_vanb.java
Containment_artur.java
Containment.java
D: Gold Leaf

Submissions: 23
Solutions: 4
goldleaf
goldleaf_vanb.java
GoldLeaf_artur.java
E: Hill Number

Submissions: 74
Solutions: 12
hillnumbers
hillnumbers_vanb.java
HILL_NUM.py
 Note: HILL.NUM.py is actually a .txt file. You will need to rename it.
F: Knights

Submissions: 13
Solutions: 4
knights
knights_vanb.java
Knights_artur.java

Note: The second program runs too long and was only used to verify the data.

G: Word Ladder

Submissions: 77
Solutions: 12
ladder
ladder_vanb.java
WL.cpp
H: Shuffles

Submissions: 32
Solutions: 10
shuffles
shuffles_vanb.java
Shuffles_artur.java
I: Stamp Stamp

Submissions: 7
Solutions: 0
stampstamp
stampstamp_vanb.java
StampStamp.java
StampStampN3.java
November 15th, 2014 | Categories: 2014 Regionals

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

Submissions: 0
Solutions: 0
carpet
carpet_vanb.java
StainedCarpet_constant1_artur.java
B: Gold Leaf

Submissions: 0
Solutions: 0
goldleaf
goldleaf_vanb.java
GoldLeaf_artur.java
C: Hill Number

Submissions: 18
Solutions: 0
hillnumbers
hillnumbers_vanb.java
HILL_NUM.py

Note: HILL_NUM.py is actually a .txt file. You will need to rename it.

D: Knight Moves

Submissions: 15
Solutions: 3
knightmoves
knightmoves_vanb.java
KnightMoves_artur.java
KnightMoves_Dennis.cpp
E: Marble Madness

Submissions: 10
Solutions: 0
marbles
marbles_vanb.java
MarbleMadness.java
MarbleMadness_artur.java
F: Polling

Submissions: 80
Solutions: 34
polling
polling_vanb.java
Polling_artur.java
G: Runes

Submissions: 73
Solutions: 5
runes
runes_vanb.java
Runes_artur.java
H: Shuffles

Submissions: 4
Solutions: 0
shuffles
shuffles_vanb.java
Shuffles_artur.java
I: Top 25

Submissions: 126
Solutions: 5
top25
top25_vanb.java
Top25_artur.java
April 8th, 2014 | Categories: 2014 NAIPC

Here are the statements of the NAIPC 2014 Problems.

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

Problem Judge Data Solutions
A: Banjo

Submissions: 16
Solutions: 0
banjo.in
banjo.out
banjo_vanb.java
BanjoThreeie_artur.java
B: Cheats

Submissions: 7
Solutions: 1
cheats.in
cheats.out
cheats_vanb.java
cheats_howard.cc
C: Diplomacy

Submissions: 41
Solutions: 11
diplomacy.in
diplomacy.out
diplomacy_vanb.java
Diplomacy_artur.java
D: Fantastic Problem

Submissions: 1
Solutions: 1
fantastic.in
fantastic.out
fantastic_vanb.java
Fantastic-Problem1.cpp
Note: The cpp program runs too slowly, and was only used to verify the data
E: GCDs

Submissions: 36
Solutions: 21
gcd.in
gcd.out
gcd_vanb.java
GCDs_artur.java
GCDs_darko.java
gcds_zheng.cpp
F: Gold Bandits

Submissions: 40
Solutions: 8
gold.in
gold.out
Gold_Calvin.java
GoldBandits_artur.java
G: Integer Estate Agent

Submissions: 64
Solutions: 20
estate.in
estate.out
integerestate_vanb.java
iea-marcf.c
IntegerEstateAgent.java
H: Reconnaissance

Submissions: 26
Solutions: 11
reconnaissance.in
reconnaissance.out
recon_vanb.java
reconnaissance_zheng.cpp
I: Super Mario 169

Submissions: 20
Solutions: 13
mario.in
mario.out
mario_vanb.java
Mario_artur.java
Mario_darko.java
J: Two Knights’ Poem

Submissions: 51
Solutions: 19
twoknights.in
twoknights.out
twoknights_vanb.java
TwoKnights_artur.java
March 30th, 2014 | Categories: 2014 NAIPC

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

data

November 2nd, 2013 | Categories: 2013 Regionals

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

Submissions: 20
Solutions: 1
mountains.judge
mountains.solution
mountains_vanb.java
BeautifulMountains_artur.java
B: Nested Palindromes

Submissions: 27
Solutions: 8
nested.judge
nested.solution
nested_vanb.java
NPAL_Yan.java
Palindrome_Calvin.java
C: Ping!

Submissions: 83
Solutions: 41
ping.judge
ping.solution
ping_vanb.java
Ping_artur.java
PING_Yan.py (See note below)
D: Electric Car Rally

Submissions: 26
Solutions: 6
rally.judge
rally.solution
rally_vanb.java
ElectricRally_artur.java
electricRally_zeil.cpp
E: Skyscrapers

Submissions: 16
Solutions: 6
skyscrapers.judge
skyscrapers.solution
skyscrapers_vanb.java
SKY_Yan.cpp
Skyscrapers_artur.java
F: Star Simulations

Submissions: 82
Solutions: 8
stars.judge
stars.solution
stars_vanb.java
StarSim_artur.java
StarSim_zeil.java
StarSimTree_zeil.cpp
G: Tandem Repeats

Submissions: 24
Solutions: 0
tandem.judge
tandem.solution
TandemRepeat_artur.java
H: Triangles

Submissions: 52
Solutions: 0
triangles.judge
triangles.solution
triangles_vanb.java
Triangles_artur.java
triangles_vanb_slow.java O(n^3), too slow
I: It Takes a Village

Submissions: 4
Solutions: 0
village.judge
village.solution
village_vanb.java
Village_artur.java
J: You Win!

Submissions: 41
Solutions: 11
youwin.judge
youwin.solution
youwin_vanb.java
WU_Yan.cpp
Youwin_artur.java
YouWin_jbrodie.java

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”

November 2nd, 2013 | Categories: 2013 Regionals

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

Submissions: 5
Solutions: 1
cake.judge
cake.solution
cake_vanb.java
CakeCutting_artur.java
CakeCutting_zeil.java
B: The n Days of Christmas

Submissions: 169
Solutions: 12
christmas.judge
christmas.solution
christmas_vanb.java
Christmas_artur.java
Christmas_Calvin.java
christmas_dennis_cin.cpp
C: Ping!

Submissions: 14
Solutions: 9
ping.judge
ping.solution
ping_vanb.java
Ping_artur.java
PING_Yan.py (See note below)
D: Electric Car Rally

Submissions: 0
Solutions: 0
rally.judge
rally.solution
rally_vanb.java
ElectricRally_artur.java
electricRally_zeil.cpp
E: Count your Cousins

Submissions: 12
Solutions: 5
cousins.judge
cousins.solution
cousins_vanb.java
Cousins_artur.java
F: Decimal Representation

Submissions: 2
Solutions: 1
decimal.judge
decimal.solution
decimal_vanb.java
Decimal_artur.java
decimal_dennis.cpp
G: Politics

Submissions: 46
Solutions: 12
politics.judge
politics.solution
politics_vanb.java
Politics_artur.java
Sort_Calvin.java
Sort_Slow_Calvin.java
H: Perfect Shuffle

Submissions: 69
Solutions: 38
shuffle.judge
shuffle.solution
shuffle_vanb.java
Shuffle_artur.java
Shuffle_Calvin.java
shuffle_dennis.cpp
I: Speed Can Cost You

Submissions: 125
Solutions: 29
speed.judge
speed.solution
speed_vanb.java
Speed_artur.java
Speed_Calvin.java
speed_dennis.cpp
SPEED_Yan.py (See note below)
J: Text Roll

Submissions: 94
Solutions: 31
textroll.judge
textroll.solution
textroll_vanb.java
Text_Roll_dennismv.cpp
TextRoll_artur.java
TextRoll_Calvin.java
textroll_dennis.cpp

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”

May 28th, 2013 | Categories: 2013 UChicago Invitational

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

Problem Judge Data Solutions
A: Winter Roads

Submissions: 8
Solutions: 1
bridges.judge
bridges.solution
bridges2_vanb.java
bridges_artur.java
B: Can of Worms

Submissions: 36
Solutions: 5
cans.judge
cans.solution
SolutionOne.java
SolutionTwo.java
solution.txt
C: Automatic Trading

Submissions: 36
Solutions: 18
trading.judge
trading.solution
automatictrading_artur.java
prefix.cpp
D: 3D Printer

Submissions: 11
Solutions: 10
threedprinter.judge
threedprinter.solution
threedprinter_vanb.java
threedprinter_topraj.java
3dprinter.cpp
E: Flooding Fields

Submissions: 42
Solutions: 10
floodingfields.judge
floodingfields.solution
floodingfields_vanb.java
floodingfields_artur.java
F: Goat Ropes

Submissions: 16
Solutions: 5
goatropes.judge
goatropes.solution
goatropes_vanb.java
goat.cpp
G: Job Postings

Submissions: 26
Solutions: 13
jobpostings.judge
jobpostings.solution
jobpostings_vanb.java
jobpostings_artur.java
H: Overlapping Maps

Submissions: 41
Solutions: 21
overlappingmaps.judge
overlappingmaps.solution
overlappingmaps_vanb.java
overlapingmaps_artur.java
maps.cpp
I: Unreal Estate

Submissions: 50
Solutions: 12
realestate.judge
realestate.solution
realestate_vanb.java
realeastate_artur.java
The program from vanb is O(n*n) and runs in contest time.The program from artur is O(n*n*log(n)). It generates correct answers, but runs too long.
J: Satisfaction Guaranteed

Submissions: 7
Solutions: 0
satisfaction.judge
satisfaction.solution
satisfactionguaranteed_vanb.java
sat.cpp
K: Uniform Subtrees

Submissions: 15
Solutions: 4
uniform.judge
uniform.solution
uniformsubtrees_vanb.java
uniformsubtree_topraj_sortedints.java
March 31st, 2013 | Categories: 2013 UChicago Invitational

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

November 10th, 2012 | Categories: 2012 Regionals

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

Problem Judge Data Solutions
A: Candy Store

Our Rating: C/D
Submissions: 27
Solutions: 1
candystore.judge
candystore.solution
candystore.java
candy_memo.cpp
CandyStore_jbrodie.hs
B: Collision Detection

Our Rating: C/D
Submissions: 16
Solutions: 0
collisiondetection.judge
collisiondetection.solution
collisiondetection2.java
collision_chinmay.cpp
CollisionDetection_zeil.java
C: Do It Wrong, Get It Right

Our Rating: C/D
Submissions: 15
Solutions: 0
doitwrong.judge
doitwrong.solution
doitwrong.java
DOIT_WRONG.cpp
doitwrong.cpp
D: Dueling Philosophers

Our Rating: A/B
Submissions: 11
Solutions: 1
duelingphilosophers.judge
duelingphilosophers.solution
duelingphilosophers.java
DUEL_PHIL.cpp
DuelingPhilosophers_jbrodie.java
DuelingPhilosophers_zeil_SERpatchedBy_jbrodie.java
E: Paint Me

Our Rating: A/B
Submissions: 90
Solutions: 41
paintme.judge
paintme.solution
paintme.java
paintMe_zeil.cpp
F: Party Games

Our Rating: A/B
Submissions: 93
Solutions: 1
partygames.judge
partygames.solution
partygames.java
PARTY.py
partyGames_zeil.cpp
G: Reverse Nonogram

Our Rating: A/B
Submissions: 58
Solutions: 28
reversenonogram.judge
reversenonogram.solution
reversenonogram.java
REV_NONO.cpp
H:Tsunami

Our Rating: C/D
Submissions: 27
Solutions: 0
tsunami.judge
tsunami.solution
tsunami.java
tsunami.cpp
Tsunami_zeil.java
I: Unhappy Numbers

Our Rating: C/D
Submissions: 44
Solutions: 0
unhappy.judge
unhappy.solution
unhappy.java
unhappy.cpp
UNHAPPY.py
J: Walls

Our Rating: C/D
Submissions: 0
Solutions: 0
walls.judge
walls.solution
walls.java
WALLS.cpp
November 10th, 2012 | Categories: 2012 Regionals

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

Problem Judge Data Solutions
A: Candy Store

Our Rating: C/D
Submissions: 108
Solutions: 30
candystore.judge
candystore.solution
candystore.java
candy_memo.cpp
CandyStore_jbrodie.hs
B: Collision Detection

Our Rating: C/D
Submissions: 48
Solutions: 4
collisiondetection.judge
collisiondetection.solution
collisiondetection2.java
collision_chinmay.cpp
CollisionDetection_zeil.java
C: Component Testing

Our Rating: E/F
Submissions: 24
Solutions: 1
componenttesting.judge
componenttesting.solution
componenttesting3.java
ComponentChecking_zeil.cpp
ComponentTesting_chinmay.cpp
ComponentTesting_jbrodie.hs
YiuComponentsTesting.java
analysis.txt
D: Do It Wrong, Get It Right

Our Rating: C/D
Submissions: 139
Solutions: 25
doitwrong.judge
doitwrong.solution
doitwrong.java
DOIT_WRONG.cpp
doitwrong.cpp
E: Funhouse

Our Rating: E/F
Submissions: 4
Solutions: 0
funhouse.judge
funhouse.solution
funhouse.java
FunHouse_zeil.java
F: A Terribly Grimm Problem

Our Rating: E/F
Submissions: 56
Solutions: 5
grimm.judge
grimm.solution
grimm.java
Grimm_jbrodie.java
Grimm_jbrodie_another.hs
Grimm_zeil.java
G: Heads or Tails

Our Rating: E/F
Submissions: 3
Solutions: 0
headsortails.judge
headsortails.solution
headsortails.java
HOT.cpp
NOFP.py
H:Tsunami

Our Rating: C/D
Submissions: 81
Solutions: 13
tsunami.judge
tsunami.solution
tsunami.java
tsunami.cpp
Tsunami_zeil.java
I: Unhappy Numbers

Our Rating: C/D
Submissions: 61
Solutions: 8
unhappy.judge
unhappy.solution
unhappy.java
unhappy.cpp
UNHAPPY.py
J: Walls

Our Rating: C/D
Submissions: 22
Solutions: 4
walls.judge
walls.solution
walls.java
WALLS.cpp
May 14th, 2012 | Categories: North America Super-Region

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.

April 15th, 2012 | Categories: 2012 UChicago Invitational

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

Problem Judge Data Solutions
A: CosmoCraft

Submissions: 0
Solutions: 0
cosmo.in
cosmo.out
cosmo.cpp
Cosmo.java
B: Covered Walkway

Submissions: 34
Solutions: 6
covered.zip
covered.out
covered.java
coverage.cpp
C: Double Dealing

Submissions: 78
Solutions: 17
doubledealing.in
doubledealing.out
doubledealing.java
double.cpp
D: The End of the World

Submissions: 38
Solutions: 21
theend.in
theend.out
theend.java
EndOfWorld.java
E: Estimation

Submissions: 42
Solutions: 12
estimate.in
estimate.out
estimate.java
estimation.cpp
F: Juggler

Submissions: 51
Solutions: 17
juggler.in
juggler.out
juggler.java
juggler.cpp
G: Red/Blue Spanning Tree

Submissions: 42
Solutions: 13
redblue.in
redblue.out
redblue.java
RedBlue.java
H:The Red Gem

Submissions: 25
Solutions: 6
redgem.in
redgem.out
redgem.java
RedGem.java
I: Science!

Submissions: 33
Solutions: 8
science.in
science.out
science.checker.cpp
science.java
science.cpp
J: The Worm in the Apple

Submissions: 3
Solutions: 3
worm.in
worm.out
worm.java
worm.cpp
November 20th, 2011 | Categories: 2011 Regionals

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.

Get Flash to see this player.

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
November 2nd, 2011 | Categories: 2011 Regionals

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.

October 29th, 2011 | Categories: 2011 Regionals

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

Problem Judge Data Solutions
A: Sunday Drive

Our Rating: C/D
Submissions: 43
Solutions: 14
sundaydrive.judge
sundaydrive.solution
sundaydrive.java
B: Hexagram

Our Rating: C/D
Submissions: 13
Solutions: 8
hexagram.judge
hexagram.solution
hexagram.java
C: Flooring Tiles

Our Rating: C/D
Submissions: 35
Solutions: 9
flooringtiles.judge
flooringtiles.solution
flooringtiles.java
D: Vive la Difference!

Our Rating: A/B
Submissions: 102
Solutions: 78
difference.judge
difference.solution
difference.java
E: Robot Navigation

Our Rating: C/D
Submissions: 16
Solutions: 7
robotnavigation.judge
robotnavigation.solution
robotnavigation.java
F: Folding Game

Our Rating: E/F
Submissions: 14
Solutions: 2
folding.judge
folding.solution
folding.java
G: Burnout

Our Rating: C/D
Submissions: 85
Solutions: 0
burnout.judge
burnout.solution
burnout.java
H:Family Fortune

Our Rating: E/F
Submissions: 3
Solutions: 0
family.judge
family.solution
family.java
I: Moving Points

Our Rating: E/F
Submissions: 4
Solutions: 2
movingpoints.judge
movingpoints.solution
movingpoints.java
J: Vampire Numbers

Our Rating: A/B
Submissions: 86
Solutions: 30
vampirenumbers.judge
vampirenumbers.solution
vampirenumbers.java

sundaydrive.java

June 25th, 2011 | Categories: 2011 Regionals

Here’s the Call for Problems that was recently sent out to all SER coaches and Problem Selection Committee members:

Summer is upon us, World Finals is over, so it’s time to start thinking, just a little bit, about the Southeast USA Regional Programming Contest. It’ll be a little bit earlier this year, on Saturday, 29 October. So, spend your summer dreaming up programming problems! Also, we’re looking for people to serve on the Problem Selection Committee. Putting together the problem set for SER is an intense, rewarding process. If you’re interested, send me an e-mail (at vanb@biltmorecomm.com).

As usual, the Problem Selection Committee will be responsible for putting the problem set together. The PSC will also be responsible for judging, so problem providers won’t have to judge. Because of this, you can provide a problem, and also coach your team, and attend the contest with them at your chosen site. Anyone can submit a problem for consideration – however, although a problem submitter can also act as a coach, they cannot be a contestant, whether or not their problem is chosen for the set. In other words, if a student submits a problem, they are ineligible to compete.

Candidate problems should be e-mailed to me (at vanb@biltmorecomm.com). A statement of the problem is all that’s necessary, either in text or in MS Word format (right in the e-mail is fine). If you wish to include a solving program and/or test data, that’s very, very helpful, but not necessary. If you have a rough idea and want to talk about it, feel free to e-mail it to me, and I’ll be happy to work with you.

Problems should be sent by Friday, 9 September to be eligible for consideration. That’s the Friday after Labor Day. I’ll remind you again, but I’m sending out the call for problems early, to get you thinking!

Below you will find an excerpt from the Call for Problems issued from World Finals this year. It’s a good set of guidelines for candidate problems. If you are thinking of submitting a candidate problem for Southeast Regionals, you should read through it. I will add a couple of constraints of my own:

  1. The problem should be original. It should not be a restatement of a problem that has been used previously in the Southeast USA, or any other ICPC regional, World Finals, or other contest environment such as TopCoder or Google CodeJam. It also should not come from a book, such as “Programming Challenges.” If it has its own Wikipedia page, then it’s too well-known.
  2. The output for any given input should be unique. Try to add constraints to your problem so that there is exactly one answer for each input case.

Don’t forget about the blog to talk about judging at our contest. It’s at:

http://serjudging.vanb.org

Feel free to drop by and give suggestions – however, do NOT post candidate problems on this site. It is open to everyone, including students. Any problem posted on the site cannot be used in the contest.

————- Some excerpts from the World Finals call for problems: ————-

Problem Statements

  1. Each problem must be unambiguously described in English.
  2. All problems must require input.
  3. Unless the core of the problem is input/output related, the formats chosen for input data and the displayed results should be relatively simple. Still, the format of the input data and the appearance of the expected displayed results must be described in suitable detail.
  4. Multiple data sets testing different cases are appropriate; make the problem statement include iterative data sets as input to avoid using separate input files.
  5. Anticipate questions about special cases. Where appropriate, explicitly state that certain special cases will not appear in the input data. It is not necessary to specifically identify the special cases that will appear.
  6. Indicate the precision that is required for real results.
  7. Contestants must write solutions for problems in a short time. While very simple problems are not appropriate, neither are problems that require a great deal of code; a few hundred lines of Java or C should be an upper limit on what can be expected in a solution.
  8. The program and chosen test data should not require excessive execution time. Contestants’ solutions may be less efficient than yours and so a generous margin is allowed for execution. If your test data requires the program to execute for a long time, then incorrect student solutions (e.g., those with infinite loops) will take an excessively long time to judge. We would like to avoid those situations.
  9. The problem description (excluding sample input/output) should generally require at most one page.

Submission of Problems, Solutions, and Test Data

  1. Use electronic mail and send all files as either MS Word document, or flat ASCII.
  2. Do not put your name in documents, or the body of e-mails, containing the problem statement, solution, or test data. This will simplify the transformation from your form to the one used for ranking.
  3. Be discreet about problem statements and solutions. It is not appropriate to discuss problems with people not involved with the contest.