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.
1 comment:
The problems from Henry's course are suggested as practice problems because the ones in the contest will have a similar flavor.
We will try to ask questions that test skills which help student do well in many CSI exams. We do not want to focus on one particular course. We do want to focus on skills that apply in many situations.
We'll give the exact rules at the latest on 15th March. In the meantime, divisions A and B should expect a contest of about 6 hours, with about 6 problems. They will have increasing difficulty and no one is expected to solve all.
Post a Comment