right now both my C# and Python solvers are adapted from
this combinational sum problem, which, given an array of allowed integers
a
, and a target sum
n
, finds all combinations of integers from
a
that sum to
n
, allowing for a given integer in
a
to be used multiple times.