International Collegiate Programming
Contest
|
2011-2012 Training Page
Here is the tentative schedule. All meetings are in CS 2310.
Regionals Meeting Agendas
Date | Discussion Topics |
Thu Sept 8, 6:00pm | Organizational Meeting |
Wed Sept 14, 6:00pm | 2010 Regionals |
Wed Sept 21, 6:00pm | Greedy, Binary Search, Basic Graph Algorithms |
Wed Sept 28, 6:00pm | Dynamic Programming, Divide and Conquer |
Wed Oct 5, 6:00pm | Network Flow |
Wed Oct 12, 6:00pm | Placement Test Discussion |
Wed Oct 19, 6:00pm | BFS on statespaces, Computational Geometry |
Wed Oct 26, 6:00pm | Team Practice 1 Discussion |
Wed Nov 2, 6:00pm | 2004 Regionals |
Wed Nov 9, 6:00pm | Team Practice 2 Discussion |
Wed Nov 16, 6:00pm | Regionals Discussion |
Programming Sessions
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. Several of these are
listed on the
links
page,
and provide a good means of practicing for the actual competition.
In the Fall, we will mainly be using practice problems from UVA and ICPC Live.
Please create an account on UVA and
ICPC Live,
and send an email to rosnbrick@wisc.edu with your
user names so that we can track your weekly progress.
All problems expect I/O to be 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".
The entire problem set as a pdf can be found here.
The entire problem set as a pdf can be found here.
The entire problem set as a pdf can be found here.
The entire problem set as a pdf can be found here.
A tar file with input/output data for all problems can be found here.
(I/O files are identified by numbers; these numbers match the naming & ordering of the problems in the provided pdf.)
The entire problem set as a pdf can be found here. The team scoreboard can be found here.
|