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.
# | User | Rating |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | Dominater069 | 154 |
8 | awoo | 154 |
10 | luogu_official | 150 |
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.
Name |
---|