The Contest is over!

The contest is now over! Thanks very much to the nearly 40 undergraduates, postgraduates, and faculty that participated! We will be analyzing and testing your programs over the coming week. Look for information here, in the contest webpage, and via email for an announcement about winners and our prize ceremony.

Practice session 2

It will start at 3pm in room B1.06 and it will last roughly two hours. We'll have problems for division A and B.

Practice Session 1

As stated in the rules, the first practice session is today.

It will start at 3pm in room B1.06 and it will last roughly two hours.

Website

The website is up.

Rules and registration

The rules are up. You can view them as pdf or as html

Also we will have a registration period from 16 March to 28 March. It will be done through the web site of the contest which will be announced shortly. (My comment to the previous entry was wrong: we do need registration in order to properly plan resources.)

March 31

The date is set.

Sample problems

Division B will face problems that are similar to these ones:

• Array


• Power crisis


• Paper folding


• Recycling


• Decoding task

Division A will have easier problems. Division X will have harder problems.

Henry's courses are another source of practice problems. Here are a few examples.

• You are given two non-decreasing arrays of integers A and B. Find the smallest difference abs(A[i]-B[j]).


• The maximum segment sum: given an array A find i and j such that the sum of A[k] with i<=k<=j is maximal.


• Coincidence count: you are given two sets as increasing arrays; how many elements are in the intersection?

Division A problems will be chosen such that they will involve algorithms that recur in many courses thought in the CSI departament.