BAPC 2010
Benelux Algorithm Programming Contest 2010, Leiden

Problems

We provide last year's problem set below, so that those who wish to participate can train their problem-solving abilities. Of course, we do not imply that this year's problems will be identical or similiar.

2010

BAPC

The following documents are available: Notes:
  • Test data: The test data in F.in is not in the format as should be read by the solutions. It just contains a representation of the mazes of all test cases. For each test case, F.out only contains the final answer, i.e. the minimum number of rooms you need to enter before reaching the exit room. The test cases can also be viewed in mazes.pdf.
  • Sample data from the problem descriptions: Because the input and output for problem F are dynamic, there is no unique sample data for that solution. Therefore, it has not been included in the set of sample data.

Preliminary rounds

The following documents are available:

2009

BAPC

The following documents are available:

Preliminary rounds

The problem set of the preliminary rounds of BAPC 2009 is also available.