gol_alu's blog

HELP!

By gol_alu, history, 8 years ago, In English

How can i solve this ? :(

How many ways to make a number n, using k number of coins from an array of coins?

where 1 <= n <= 10 ^ 9 and 1 <= k <= 10

for example if the array is A[1, 2, 3, 5, 8, 13] and k = 4 and n = 13 . Answer will be 4

as, 1 + 1 + 3 + 8 = 13, 1 + 2 + 2 + 8 = 13, 1 + 2 + 5 + 5 = 13, 2 + 3 + 3 + 5 = 13

Thanks in advance :)

  • Vote: I like it
  • -13
  • Vote: I do not like it

»
7 years ago, # |
  Vote: I like it 0 Vote: I do not like it

It will help you probably (if you still need help LOL) https://en.wikipedia.org/wiki/Knapsack_problem

→ Reply
  • »
    »
    7 years ago, # ^ |
    ← Rev. 2   Vote: I like it 0 Vote: I do not like it

    LOL... you made him lose more contribution ( from 12 downvotes 10 seconds ago -i remember- to 14 and the number will increase till the entry is hidden from recent actions ) hh

    → Reply