Magic Capsules
Fan Chi'ih has brought magic capsules from China, each with a specific production cycle that produces a gold coin on the last day of the cycle. By activating all the capsules simultaneously, he wants to know how many days it takes to accumulate at least exact number of gold coins. You are given a needed number of gold goal and a sequence of capsules' cycles cycles.
Here is an example for 12, (3, 7, 2) arguments.
Input: Integer (int) and list (list) of integers.
Output: Integer.
Examples:
assert num_days(12, [3, 7, 2]) == 14 assert num_days(100, [17, 13, 20, 10, 12, 16, 10, 13, 13, 10]) == 130 assert num_days(20, [1, 2, 3, 4, 5]) == 10 assert num_days(5, [10, 1]) == 5
