(r3) ProgrammingContest < Main

Tags: view all tags
This page is dedicated to UBC ACM ICPC Teams to discuss stuff that should normally be incomprehensible to normal beings.

---+ Code orders
Please place your order here. Assignments are not welcomed. It is better if you can cite the problem you are solving, or provide pseudo codes and reference, so that the potential author can edit it.

%SEARCH{ "ContestProblem" scope="topic" nosearch="on" nototal="on"  web="all" format="$text" }%

%SEARCH{ "ContestProblem" scope="topic" nosearch="on" nototal="on"  web="Main" format="   * [[$topic]]" }%

---++ Gaussian Elimination on general M*N matrix
---++ SVD for M*N matrix
useful for Pseudo Inverse, Nullity Checking, Range checking

---+ Problem Discussion

---++ Euler Circuit (10735)
Basically, we need to do a Maximum Flow to assign as much undirected edges as possible. Then we run the normal recursive/backtracking-like euler circuit algorithm to get the path.

   * Set ALLOWTOPICCHANGE = DuckySherwood, MatthewChan
Topic revision: r3 - 2005-11-17 - DuckySherwood