cakes | censorship | change | dice | divisibility | go | jogger | pool | |
Input | cakes.in | censorship.in | change.in | dice.in | divisibility.in | go.in | jogger.in | pool.in |
Output | cakes.out | censorship.out | change.out | dice.out | divisibility.out | go.out | jogger.out | pool.out |
chuongdo | cakes.cc | censorship.cc | change.cc | dice.cc | divisibility.{cc/java} | go.cc | jogger.{cc/java} | pool.{cc/java} |
darthur | cakes.cc | censorship.cc | change.cc | dice.cc | divisibility.cc | go.cc | jogger.cc | pool.cc |
sonny | cakes.cc | change.cc | dice.cc | divisibility.cc | go.cc | jogger.cc | pool.cc | |
rokicki | cakes.java | dice.java | divisibility.java | |||||
yw1984 | cakes.cc | censorship.cc | change.cc | dice.cc | divisibility.cc | go.cc | jogger.cc | pool.cc |
tanonev | cakes.java | change.java | dice.java | divisibility.java | go.java | pool.java | ||
mhwu | cakes.cc | change.cc | dice.cc | divisibility.cc | go.cc | jogger.cc |
Problem | # #AC | %AC %CE %PE %RE %TL %WA | Fastest Avg -------------+---------+-----------------------------------+---------------- cakes | 43 6 | 13.95 0.00 0.00 0.00 13.95 72.09 | 12 94.50 censorship | 14 1 | 7.14 0.00 0.00 0.00 92.86 0.00 | 93 93.00 change | 9 6 | 66.67 0.00 0.00 22.22 11.11 0.00 | 35 137.67 dice | 50 10 | 20.00 2.00 0.00 4.00 48.00 26.00 | 15 67.60 divisibility | 37 20 | 54.05 0.00 0.00 10.81 18.92 16.22 | 4 41.10 go | 15 9 | 60.00 0.00 0.00 0.00 13.33 26.67 | 41 101.11 jogger | 6 2 | 33.33 0.00 0.00 0.00 0.00 66.67 | 110 134.00 pool | 11 3 | 27.27 0.00 0.00 0.00 0.00 72.73 | 113 169.00 -------------+---------+-----------------------------------+---------------- TOTAL | 185 57 | 30.81 0.54 0.00 4.32 28.65 35.68 | 4 81.91The problem set is available in PDF and PS format.
Instructions for the contest and a practice problem have been posted in PDF
and PS format. Please try these out before the contest to make sure that the contest scripts
are working properly for you.
If you have a conflict with the official contest date, and would like to take the contest early on Friday, please email me.
This year, Palantir Technologies will be sponsoring free pizza
following the contest in Gates 104, so come and hang out with us!
The regional contest will be held on Saturday, November 10, 2007.
For those who earn spots on the Stanford ACM team, we will hold team practices on the
weekends leading up to the Regional contest.
Once again, Stanford will be hosting a local programming contest to select the students who will represent Stanford at the 2007 ACM Pacific NW Regional Contest, and hopefully, at the 2008 ACM International Collegiate Programming Contest in Alberta, Canada!
The local contest will be an individual contest (students compete as individuals, and not on teams). The top six individuals will be grouped to form two teams of three students each to represent Stanford at the regional contest.
The top two teams at the regional contest qualify for the International Contest Finals to be held in mid-April. The winning students not only bring fame and glory to their university, they also win hefty scholarships ($$) and plenty of free software.
The contest pits teams of three individuals working on a single computer against a host of problems (typically 7-10) that must be solved in five hours. These problems can generally be solved by careful analysis and application of algorithms taught in undergraduate computer science. Some are quite challenging. For examples, see the problems from previous years of this contest.
To qualify for a spot on the Stanford ACM team:
NOTE: Even if you're not eligible to compete for a spot on the Stanford ACM team, as long as you have a Leland account, you may participate in the local contest anyway! Come join the fun!
STEP ONE: Send an e-mail to indicating that you will be competing so that we can get a rough idea of how many students to expect. Please also mention
compile error
run-time error
time-limit exceeded
wrong answer
presentation error
Success in the ACM programming contest requires a combination of coding speed and algorithmic ability. To make sure that you're ready for the contest, make sure that you are comfortable with the programming environment for the local contest (see Rules and FAQ above). Contest problems typically involve dynamic programming, search, simulation, geometry, and more.
The best way to prepare for ACM-style programming problems is to practice! The Universidad de Valladolid Problem Set Archive has tons of problems that you can solve and an online judge for grading your solutions automatically. Other problem set archives may be found here and here. Also, check out the problems from previous contests in the section below. Although it uses a different competition format, the online TopCoder weekly matches provide very useful preparation for ACM; one of the most useful features of the website is the ability to look at other contestant's solutions to problems from previous contests.
2006 Stanford Local Programming Contest
2005 Stanford Local Programming Contest
2004 Stanford Local Programming Contest
2003 Stanford Local Programming Contest
2002 Stanford Local Programming Contest
2001 Stanford Local Programming Contest
2000 Stanford Local Programming Contest
1999 Stanford Local Programming Contest
1998 Stanford Local Programming Contest
1997 Stanford Local Programming Contest
1996 Stanford Local Programming Contest
1998-2003 Pacific Northwest Regional Contests
2003-2004 ACM ICPC Regional Contests
2002-2003 ACM ICPC Regional Contests
2001-2002 ACM ICPC Regional Contests
2007 ACM ICPC World Finals