In this puzzle
Can someone explain why in Test1 the number 440 is polydivisible in base 16?
for input 04 04 00
output:
5
6
8
9
11
12
14
15
16
20
24
28
29
35
The number 440 in base 16 is 1088 in base 10, and 1088%3 != 0
What am I doing wrong?
040400 in base 16 is 1088 in base 10
it is polydivisible because
1 %1 = 0
10 %2 = 0
108 % 3 = 0
1088 % 4 = 0
There are 64-bit floating point values, the largest exact integral value is 253-1, or 9007199254740991 . In ES6, this is defined as Number.MAX_SAFE_INTEGER.
Solving Test5 In this Puzzle with javascript:
Input: 02 00 08 05 05 08 00 01 00 15 14 08 18 06 15 06 00
to Base10: 10175610942948463398092800 (as a String)
for example while trying to resolve if the number is polydivisible you won’t be able to parse the string 10175610942948463 to Integer
is it possible to remove the tests which resolving the overflow?
(btw it is possible to solve the puzzle with BigInt library in node environment`)
My code passes all the test cases, but when I submit the code, it passes all except Validator 3. Does anyone know what this one might be testing for that I’m missing in my code? Would be helpful to have some kind of hint because I cannot at all figure out what I’m missing in this one.