ACM Regional Programming Contest Practice 

(Fall 2009)


Nov 3: The Teams Contest problems are here.

Oct 29: The Teams Contest will be held on Tuesday, Nov. 3, 3:30-6:30 in the CSIF labs in Kemper.

Oct 25: 2009 UC Davis Local ACM Programming Contest, 10am - 2pm.
Oct 22: Our fist Local Contest (singles) will be held on Sunday, Oct 25, 10am-2pm.

Weekly Meetings: Thursday, 4:30-6:00p in Kemper 3083.

This webpage is to provide some guidance in training for the ACM Regional Competition.
Professor Vladimir Filkov is the UC Davis coach. Contact me asap if you want to participate.

Every week, we will post three to four problems, covering several topics, for all to try.
Most problems here will be taken from the UVa website unless otherwise noted. 
You can register with their site and have them judge your program.

These problems are designed to be solvable in less than five hours. If you find yourself taking
more than two hours on one problem, you may be going at it the wrong way. 
Please be honest with yourself and do not take solutions from other websites 
(except for comparison or reference when needed). The contest itself has running time and 
memory constraints, so try to design your solutions for accuracy and keep in mind efficiency.

In addition, we are all reading and understanding past problems. Start from our region's past
problems from the link above. 

Good luck!

Problem Sets:

Week 5 (Oct. 29)

                Problem 1 (dynamic programming)
                Problem 2 (dynamic programming)
                Problem 3 (?)

Week 4 (Oct. 22)

            Finish the problems from the Local Contest.

Week 3 (Oct. 15)

                Problem 1 (grid+backtracking)
                Problem 2 (graph+backtracking)
                Problem 3 (geometry)
                Problem 4 (math)

Week 2 (Oct. 9):

                Problem 1 (data structure)
                Problem 2 (graphs)
                Problem 3 (grid)


Week 1 (Oct. 2):

                Problem 1
                Problem 2
                Problem 3
                Problem 4

Useful Links: