The ACM contest this year in on Nov. 5th. We will take 4 teams to the Duke University Site. Rules are simple, each team consists of 3 students, one computer, 10 problems, 5 hours - the team that solves the most problems wins. There will be practice sessions weekly and a couple of local competions before the contest. Weekly practice sessions are on Friday - 3:30PM-until we decide to quit. Starting on Sept 9th.

• Any one can participate freshmen to seniors.
• We have room for 12 students, 4 teams. One team is generally reserved for freshmen.
• We pay for the experience, $135/team.
• The teams have not been selected.
• Historically, the freshman team has yet to fail me. They always score at least one correct solution.
• Major practice session on Sept 24th - 12-5PM in the computer lab - CH-149. Create an account at Kattis.
• A contest site that maintains a problem set from past ACM ACM-ICPC Live Archive. Goto the North America - Mid Atlantic region. You will need an account here as well.
• Each contestant should attempt to solve as many problems as possible between now an the contest date (Nov 5th).
• Here is another programming contest practice www.spoj.pl. Log-on and try out Problem #1.
• Another good programming contest practice site is International Web site
• Report solutions to Mr. Shore. We will maintain the solved problem list below.

• 1 - Stuck In A Time Loop
• 2 - Quick Brown Fox
• 3 - Bijele
• 4 - Simon Says
• 5 - Alphabet Spam

Below is a list of students that have expressed an interest. If your name is not in the list, and you want to be in the list or taken out, please let me know.

1. Chris Finlan, 1, 4
2. Chris Jiang, 3
3. Charles Palacios, 1
4. Joanna Fass
5. Justin Cameron, 3
6. Jackson Inchalik, 1, 2, 5
7. Manuel Cabrejos
8. Matthew Olker
9. Michael Newton
10. Paul Jesukiewicz, 2
11. Ryan Felton, 2
12. Will Baur

• From the ACM-ACPC Live Archive
  • 2008 ACM Regional Contest - 4192, 4197, 4193, 4199, 4195 (listed in increasing order of difficulty based on the number of teams that correctly solved the problem) Winning team solved 7, our best got 3 (38th overall), Elon got 2( 75th).
  • 2007 ACM Regional Contest - 3919, 3926, 3920, 3922, 3923 (listed in increasing order of difficulty based on the number of teams that correctly solved the problem) Winning team solved 4, our best got 2 (19th overall), Elon got 2 (28th).
  • 2006 ACM Regional Contest - 3579, 3615, 3580, 3614, 3612, 3613 (listed in increasing order of difficulty based on the number of teams that correctly solved the problem) Winning team solved 5, our best got 2 (25th overall), Elon got 2 (21st).
  • 2005 ACM Regional Contest - 3426, 3429, 3431, 3428, 3432, 3433, 3430 (listed in increasing order of difficulty based on the number of teams that correctly solved the problem) Winning team solved 5, our best got 2 (44th overall), Elon got 2 (38th).
• From the Sphere Online Judge site.
  • 123, 902, 261, 1026, 2530