Computer Sciences Dept.

International Collegiate Programming Contest

2008-2009 Training Page

All meetings are held in 2310 CS. Our practice schedule is as follows:

Regionals Meeting Agendas

DateDiscussion Topics
Wed, Sep 10th, 6:00pmContest overview, introductions
Wed, Sep 17th, 6:00pm2007 Regionals (judge data, solutions)
Wed, Sep 24th, 6:00pmGreedy and Basic Graph Algorithms
Wed, Oct 1st, 6:00pmDivide and Conquer / Dynamic Programming
Wed, Oct 8th, 6:00pmNetwork Flow
Wed, Oct 15th, 6:00pmPlacement Test Discussion (judge data, partial solutions)
Wed, Oct 22nd, 6:00pmComputational Geometry
Wed, Oct 29th, 6:00pmTeam Practice 1 Discussion (judge data)
Wed, Nov 5th, 6:00pm2004 Regionals (judge data)
Wed, Nov 12th, 6:00pmTeam Practice 2 Discussion (judge data)
Sat, Nov 15th, 6:45amRegionals (judge data)
Wed, Nov 19th, 6:00pmRegionals Debrief

Programming Sessions

All programming sessions are held in 1351 CS.

Sun, Oct 12th, 12-5pm Individual Placement Test (scoreboard) (judge data, partial solutions)
Sun, Oct 26th, 12-5pm Team Practice 1 (judge data)
Sun, Nov 9th, 12-5pm Team Practice 2 (judge data)

Problem Sets

There are several free websites that have ICPC problems listed and allow you to submit problems, and they will automatically score your solution for you just like at the real contest. We will mainly be using practice problems from UVA.

Please create an account on UVA using the password we gave you during the meeting. Once you have registered please send an email to mwa+icpc@cs.wisc.edu with your user name so that we can track your weekly progress.

All problems expect I/O to done using standard input and standard output. The solution to problems must be written in a single file. If you are programming in Java the application class should be called "Main".

Greedy and Basic Graph Algorithms

Word Transformation
Asterix and Obelix
Maximum Product
Watering Grass
Shoemaker's Problem

Divide and Conquer / Dynamic Programming

Power of Matrix
Let Me Count the Ways
Little Red Riding Hood
Longest Common Subsequence
Pebble Solitaire
Trial of the Milliennium

Network Flow

Heavy Cargo
The Problem with the Problem Setter
Bob Laptop Woolmer and Eddie Desktop Barlow

Computational Geometry

Treasure Map
Crossed Ladders
The Closest Pair Problem
Useless Tile Packers
Sunny Mountains
Video Surveillance

Computer Sciences | UW Home