Difference: ProgrammingContest (3 vs. 4)

 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.
-<
<
+test


-- DuckySherwood - 17 Nov 2005

 

 ContestProblemGaussianElimination
 

 Gaussian Elimination on general M*N matrix 
 SVD for M*N matrix 
useful for Pseudo Inverse, Nullity Checking, Range checking
->
>
+ CodeOrderGaussianElimination
  CodeOrderSVD
  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
->
>
+ Set ALLOWTOPICCHANGE = DuckySherwood, MatthewChan,  YuryKholondyrev