Differences

This shows you the differences between two versions of the page.

--- competitive_programming_2012 [2012/10/04 11:48] – [Class/Lab Schedule for Fall 2012] jtkorb
+++ competitive_programming_2012 [2012/11/06 08:21] – [CS 39000-CP0: Competitive Programming] jtkorb
@@ Line 9: / Line 9: @@
 Text: //Competitive Programming 2//, by Halim and Halim, Lulu.  You may get either the original (2011) [[http://www.lulu.com/shop/steven-halim/competitive-programming-2/paperback/product-16377304.html|A5 edition]] or the new (2012), larger [[http://www.lulu.com/shop/steven-halim/competitive-programming-2-a4/paperback/product-20143247.html|A4 edition]].
-<WRAP round info 70%>
+<WRAP round info 70%>\\
-**//ICPC Qualification Contest: Sep. 29, 3:00-8:00 pm (pizza included!).//**
+**//Class is over for the semester!\\
+Congratulations to all ACM ICPC ECNA RPC participants.  Results are at the [[http://acm.ashland.edu|Ashland]] site.  Good luck next year!//**
 </WRAP>
 ====== Course/Lab Meetings (Required) ======
@@ Line 23: / Line 24: @@
 ====== Other Events (Mark Your Calendar!) ======
   * Sep. 29, 3:00-8:00 pm: //Practice Contest// (pizza included!).  All Purdue students welcome (not just CS 39000-CP0 students).  Sign up [[http://cs.ecs.baylor.edu/~hamerly/icpc/qualifier_2012/|here]] for "East Central NA Qualifier".  Send [[mailto:jtk@purdue.edu|me]] with your ICPC login (preferably your Purdue email address).
-  * Oct. TBD, 5:00-9:00 pm: //Practice Contest// (pizza included!).
   * November 2-3, 2012: //ACM Regional Contest.//  Leave Friday (11/2) at 1:00 pm for Cincinnati, compete Saturday (11/3) 10:00-3:00, return Saturday evening.  Only the 12 students who are chosen to compete in the contest are required to attend.
 ====== Class/Lab Schedule for Fall 2012 ======
@@ Line 34: / Line 34: @@
   - [09/27]: [[https://docs.google.com/presentation/d/1Ju5K2E0AK-4Q_ido5fqcf9d22BoFOJXEmCW1WUBD_98/edit|Announcements and Notes.]] [[contest_2012-09-27|Contest: Dynamic Programming I]]
   - [10/04]: [[https://docs.google.com/presentation/d/1jFAmWRVlJKe1Ndffj2Q9_-F5GZQ02wohWfXYAUD9HWQ/edit|Announcements and Notes.]] [[contest_2012-10-04|Contest: Dynamic Programming II]]
-  - [10/11]: [[contest_2012-10-11|Contest: TBD]]
+  - [10/11]: [[https://docs.google.com/presentation/d/1HsLjaX7WHsVL4NFUzdIhaUm4ZlqSNdMc1XN0YLwGtXE/edit|Announcements and Notes.]] [[contest_2012-10-11|Contest: Graph Traversal]] (also, for help testing, try using the [[dominator_data|Dominator Data]])
-  - [10/18]: [[contest_2012-10-18|Contest: Graph Traversal]]
+  - [10/18]: [[https://docs.google.com/presentation/d/14dO7CGuSSBJO-BEwoLR175SSm7wr3hprDXU9ch0fReM/edit|Announcements and Notes.]] [[contest_2012-10-18|Contest: More BFS (Single-Source Shortest Path)]]
-  - [10/25]: [[contest_2012-10-25|Contest: Minimum Spanning Tree]]
+  - [10/25]: [[https://docs.google.com/present/edit?id=0AcVsm1lcySCMZHB2djg1cF82MWhydGh4NWZ3|Teaming Notes.]] [[contest_2012-10-25|Contest: PC^2 Team Set]]; [[http://livearchive.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=331|ECNA 2008 at OnlineJudge]] (link is flaky; when it works, it links to livearchive.onlinejudge.org)
-  - [11/01]: [[contest_2012-11-01|Contest: Single-Source Shortest Path]]
+  - [11/01]: [[https://docs.google.com/present/edit?id=0AcFgahwA2c79ZHRmejNwbl82aGZycTZzZDU|Contest Notes.]] [[contest_2012-11-01|Contest: PC^2 Team Set]]
 Other topics to be sprinkled in:
+  - [00/00]: [[contest_2012-00-00|Contest: Minimum Spanning Tree]]
   - [00/00]: [[contest_2012-00-00|Contest: All-Pairs Shortest Path]]
   - [00/00]: [[contest_2012-00-00|Contest: Max Flow]]