I tried this expression, and it did fail some of them, but i put the total multiplication at the end, and it passed all cases, and now I'm completely confused.
I think that naming the thing represented here a "number system" (instead of "number base system") would be okay. Number systems can be irregular in many ways, for example roman numerals, or factoradic system. Not many of them end up in ambiguous representations, true. But I think that if you squint your eyes hard enough, the "numeric system", without "base", would still fit.
Return result with maximum precision and compare with approximate equality.
It's the effect of rounding.
So, I should make it so no rounding is needed?
I tried this expression, and it did fail some of them, but i put the total multiplication at the end, and it passed all cases, and now I'm completely confused.
Is it because of floating point conversion?
No, use
math.pi.Don't round
https://docs.codewars.com/authoring/recipes/floating-point
This comment is hidden because it contains spoiler information about the solution
done
Oh. Even though it isn't a DIRECT clone of those, I'll still take it down. Thanks
Duplicate to many prime factorization katas on Codewars, such as
https://www.codewars.com/kata/534a0c100d03ad9772000539
https://www.codewars.com/kata/542f3d5fd002f86efc00081a
confirmation about this specific reason: link
It is one of the reasons, yes.
I think that naming the thing represented here a "number system" (instead of "number base system") would be okay. Number systems can be irregular in many ways, for example roman numerals, or factoradic system. Not many of them end up in ambiguous representations, true. But I think that if you squint your eyes hard enough, the "numeric system", without "base", would still fit.
Is this why I should add random test cases?
Loading more items...