Knapsack problem/Unbounded answer in PARI/GP
Hi, I flagged your answer as incorrect, and I will apologise if the name of the flag "incorrect" might have caused offence, but its the name of the flag used on RC when someone thinks that the example given strays too far from the task description and unfortunately might have an impolite handle to the uninitiated.
The problem I saw with your code was that all the output printed were not of the maximal value. It printed the best values so far as it converged to the maximal. I would expect, (and you could check by looking at a few of the other examples outputs), that the only printout should be of one or more (probably one or all four), of the maximal values. It would be good to carry on the conversation on the relevant talk page here. --Paddy3118 05:25, 31 October 2010 (UTC)