Difference: ProgrammingContest (4 vs. 5)

Line: 1 to 1
	This page is dedicated to UBC ACM ICPC Teams to discuss stuff that should normally be incomprehensible to normal beings. Code orders
Line: 11 to 11
	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.
Added:
> >	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

Code orders