csum.jl 335 B

12345678910111213
  1. function num_paths(startsum,lastcoin)
  2. startsum == 250 && return 1;
  3. paths = 0;
  4. for coin in [1,2,5,10,20,50,100,200]
  5. if ((lastcoin>=coin) && (startsum<=(250-coin)))
  6. paths += num_paths(startsum+coin,coin)
  7. end
  8. end
  9. return paths
  10. end
  11. println(num_paths(parse(Int,ARGS[1]),parse(Int,ARGS[2])));