i solve this problem using memoization recursive function (UVa 10306 — e-Coins) , but when i try bottom up i don't know how to make all possible sum pairs in 2d table using their rows and columns indexes , any ideas ? thanks in advance.
All possible sum of pairs in 2d dynamic programming table
i solve this problem using memoization recursive function (UVa 10306 — e-Coins) , but when i try bottom up i don't know how to make all possible sum pairs in 2d table using their rows and columns indexes , any ideas ? thanks in advance.