ProgrammingTeam < Main

---+ 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:
   * [[http://icpcres.ecs.baylor.edu/onlinejudge/][new UVa site]]
   * [[http://acm.uva.es/problemset/][old UVa site]]
   * [[http://www.geocities.com/acmbeganer/AcmProblemsetTricks.htm#dif%20ana][100 easy problems]]
   * [[http://en.wikipedia.org/wiki/ACM_International_Collegiate_Programming_Contest#Online_judges][Wikipedia list of online judges]]

Other contests
   * We frequently do the Waterloo practices, which require using a [[http://plg.uwaterloo.ca/~gvcormac/pc2/][special version of pc2]] and has a different [[http://canola1.uwaterloo.ca/~acm00/scoreboard/][scoreboard]]
   * [[http://www.topcoder.com/][TopCoder]]
   * [[http://www.bitwise.iitkgp.ernet.in/index.php?q=home][Bitwise]] 10 Feb 2008
   * [[http://www.spoj.pl/][Sphere online judge]] 3 Feb 2008
   * [[http://ace.delos.com/usacogate/][USA Computing Olympiad]]
   * [[http://felicity.iiit.ac.in/codecraft/][CodeCraft]] 27 Jan 2008 (India)
   * [[http://felicity.iiit.ac.in/~math/][Mathematika 2008]] 4 Feb 2008 0030h (India)
   * [[http://felicity.iiit.ac.in/~kk/][Kode Konundrums]] 3 and 4 Feb 2008 0730? (India)
   * http://olympiads.win.tue.nl/ioi/misc/other.html

Coach preparation:
   * ProgrammingTeamCoachNotes

Articles on preparation:
   * [[http://www.acm.org/crossroads/xrds7-5/contests.html][common newbie mistakes]]
   * [[http://www.acm.org/crossroads/xrds14-1/teamwork.html][teamwork]]

Recommended for newbies:
   * [[http://www.geocities.com/acmbeganer/AcmProblemsetTricks.htm#dif%20ana][list of basic problems from trivial to hard]]
   * [[http://www.topcoder.com/tc?module=Static&d1=tutorials&d2=planApproach1][article on kata coding at top coder]]
   * [[http://www.csebuet.org/advice/interview-programmers.html][A Virtual Meeting with World's ACM-ICPC Programmers]]
   * Also highly recommended: signing up for the [[http://icpcres.ecs.baylor.edu/onlinejudge/index.php][UVa Online judge]]

Sources for old problems:
   * [[http://sharif.edu/~acmicpc/acmicpc07/archive.html][Tehran contests]]
   * [[http://www.acm.inf.ethz.ch/ProblemSetArchive.html][mostly old contests]]
   * [[http://www.logos.ic.i.u-tokyo.ac.jp/icpc2007/][Tokyo contests]]
   * [[http://www.logos.ic.i.u-tokyo.ac.jp/icpc2007/past.html][Japan regionals]]
   * [[http://neerc.ifmo.ru/past/2004.html][Northeastern Europe]] Northern has data
   * <strike>[[http://icpc.cs.bme.hu/public_download/][ICPS archive]]</strike> (in Hungarian)
   * <strike>[[http://www.socalcontest.org/current/index.shtml][soCal]]</strike> (no data)
   * [[http://www.bapc.nl/?p=problems][Benelux]]

ACM ICPC blog:
   * [[http://www.daffodilvarsity.edu.bd/acmsolver/][ACM Solver]]
   
Solutions
   * [[http://www.comp.nus.edu.sg/~stevenha/programming/acmoj.html][Steven's solutions]]
  
Books
   * [[http://www.comp.nus.edu.sg/~stevenha/database/Art_of_Programming_Contest_SE_for_uva.pdf][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.



-- Main.DuckySherwood - 23 Nov 2007
This topic: Main > TWikiUsers > DuckySherwood > DuckyHomework > ProgrammingTeam
Topic revision: r15 - 2008-03-15 - TWikiGuest