ACM Programming Contest -- UBC teams

The UBC programming team has done very well in past years. See the ProgrammingTeamHistory.

In April 2008, the team will be going to the World Finals in Banff

• ProgrammingTeamBanffLogistics
• ProgrammingTeamWorldFinalsContestInfo

Online judging / solo-practicing:

• new UVa site
• old UVa site
• 100 easy problems
• Wikipedia list of online judges

Other contests

• We frequently do the Waterloo practices, which require using a special version of pc2 and has a different scoreboard
• TopCoder
• Bitwise 10 Feb 2008
• Sphere online judge 3 Feb 2008
• USA Computing Olympiad
• CodeCraft 27 Jan 2008 (India)
• Mathematika 2008 4 Feb 2008 0030h (India)
• Kode Konundrums 3 and 4 Feb 2008 0730? (India)
• http://olympiads.win.tue.nl/ioi/misc/other.html

Coach preparation:

• ProgrammingTeamCoachNotes

Articles on preparation:

• common newbie mistakes
• teamwork

Recommended for newbies:

• list of basic problems from trivial to hard
• article on kata coding at top coder
• A Virtual Meeting with World's ACM-ICPC Programmers
• Also highly recommended: signing up for the UVa Online judge

Sources for old problems:

• Tehran contests
• mostly old contests
• Tokyo contests
• Japan regionals
• Northeastern Europe Northern has data
• ICPS archive (in Hungarian)
• soCal (no data)
• Benelux

ACM ICPC blog:

• ACM Solver

Solutions

• Steven's solutions

Books

• Art of Programming Contest (online)

Ideas for notebook contents:

• TBD: look at links at http://www.daffodilvarsity.edu.bd/acmsolver/teamnotebook/
• extended GCD
• Rubick's cube
• bioinformatics "edit distance" algorithm -- Ducky, find this one
• Line intersection.
• Line segment intersection.
• Line and line segment intersection.
• Convex hull.
• If a point is within a polygon.
• From a large number of points what is the number of maximum points on a single line.
• Closest pair problem. Given a set of points you have to find out the closest two points between them.
• Try to learn how to use C's built-in qsort() function to sort integers and records.
• Area of a polygon (convex or concave).
• Center-of-gravity of a polygon (convex or concave).
• Minimal circle, a circle with the minimum radius that can include the coordinates for a given number of points.
• Minimal sphere.
• Whether a rectangle fits in another rectangle even with rotation.
• Identify where two circles intersect. If they don't, determine whether one circle is inside another or if they are far away.
• Line clipping algorithms against a rectangle, circle, or ellipse.

-- DuckySherwood - 23 Nov 2007