No need to use simplex alg.
Simple brute force linear programming done in O( Choose(10,4) * 4^3 ) time

What is the intended solution for this problem? I used simulated annealing in order to get AC, but I don't think this is intended to pass.

Is it standard maxflow problem?
May be it is 4-types of products flow?

AC  without times using.
LP problem for 4-component flow
with help of simplex method(my smpmeth is above struct{__int64 intpart;__int64 num;__int64 denum;char sign;};)
By the way, very good question:
why maxflow algo doesn't work.



Edited by author 24.10.2010 01:48

Edited by author 24.10.2010 01:49