Thanks! Solved it now.
On Feb 12, 4:20 am, Lego Haryanto [EMAIL PROTECTED] wrote:
Can be solved by dynamic programming. It can scale also even when we expand
this and introduce the 5, 6, or more coefficients.
Think of small stuff first. We know immediately the solution of x1 = n has
only
Brute force will work here, since there are only 4 variables. So 3 loops.
Loop for x2, x3 and x4 values within limits. Total calculations are
500*333*250, small enough to complete within 5 seconds.
Of course the better approach is DP.
On 2/12/07, [EMAIL PROTECTED] [EMAIL PROTECTED] wrote:
