Base: part 1
This is part 2, Strongly suggest you go try out the first one if you haven't tried it.
Story
As one of the solvers, You've managed to get to the door of the base heaven. In front of the door stands the base guard @lyxal, they were angry that you all just left the encoded text on the ground, they demand that you clean (decode) the ground before joining the party, those who are irresponsible get no ticket!
Task
You will get 2 inputs
- First being
X
which is a non-negative integer in base of base list. - Second being base which is a list of bases.
- bases range from 1 ~ 10
- The base will contain at least one not
1
base - answer should be in the base 10
Example:
X, [bases] -> answer
110 ,[2] -> 6
30 ,[2,4] -> 6
2100 ,[2,3] -> 30
0 ,[any bases] -> 0
You may want to look at part 1 for more detail
Rule
- No loopholes
- Input/Output in any convenient, reasonable format is accepted.
Satisfy Lyxal with the shortest code, because a long code indicates that you are lazy and not doing your best!
X
as a list of digits? \$\endgroup\$