Difference: ProgrammingContest (1 vs. 7)

Revision 72005-11-18 - MatthewChan

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

Revision 62005-11-18 - MatthewChan

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: 17 to 17
 

Changed:
<
<
>
>
 

Revision 52005-11-17 - YuryKholondyrev

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

 

Revision 42005-11-17 - MatthewChan

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

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.
Changed:
<
<		test

-- DuckySherwood - 17 Nov 2005

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.
Changed:
<
<
>
>
 

Revision 32005-11-17 - DuckySherwood

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

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.
Added:
>
>		test

-- DuckySherwood - 17 Nov 2005

 

Gaussian Elimination on general M*N matrix

SVD for M*N matrix

useful for Pseudo Inverse, Nullity Checking, Range checking

Revision 22005-11-17 - MatthewChan

Line: 1 to 1
Added:
>
>		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.

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.
 

Revision 12005-11-17 - DuckySherwood

Line: 1 to 1
Added:
>
>
View topic | History: r7 < r6 < r5 < r4 | More topic actions...
 
This site is powered by the TWiki collaboration platform Powered by PerlCopyright © 2008-2025 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding TWiki? Send feedback