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.

• 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.

Code archive

• Maximim Flow - short version Code_MaximumFlowShort
• Maximim Bipartite Matching - short version (also fast) Code_BPTShort
• Euler Circuit - Code_EulerCircuit

---

• Set ALLOWTOPICCHANGE = DuckySherwood, MatthewChan, YuryKholondyrev, SapphireJay