I don't think you understood what I was trying to say. Normally, bigint is coded using an array of multiple unsigned longs, with each one representing ~60 bits of the original big number. But this kata uses strings. Which is fine, of course, but I suggested that you mention that wasn't standard.

The task mentions clearly that inputs are strings, so it should serve as a good hint that inputs can go beyond the range of unsigned longs. So closing this one ^^

JS translation

looks similar to https://www.codewars.com/kata/possibilities-of-throwing-a-coin-n-times

Fixed.

Something seems wrong with the first sample C++ test. The expected makes no sense.
Expected: equal to [ "HT", "HT", "HT", "HT" ]
Actual: [ "HH", "HT", "TH", "TT" ]

Update: I see now; the Expected and Actual are reversed in the test.

Fixed the precision of printed values.

Hey, I really think that you should mention that strings are not the standard way of representing bigintegers, and to speed your code up, you should use an array of unsigned longs instead. I fell too deep into the string bigint rabbit hole before I realised myself.

https://www.codewars.com/kumite/6319e777b80b15c8265ce45c?sel=6319e777b80b15c8265ce45c

NASM translation!

dude what the~

Those informations are better in solution set up.

@avighna the solution setup had already had extern malloc
The function declaration in comment char *play_pass(const char *phr, int shf) prompts that phr is const and should not be modified!
Anyway thanks for adding the comments in description!
But now your fork can only be approved by the author or admins.

@g964
The fork is ok!
've thought that it is clear from the function header to allocate memory yourself...

Exact floating-point equality is completely fine in this kata. Floating-point computations are not random. All rules are specified in the description (make sure that everything is evaluated from left to right and use the most precise conversion from strings to numbers).

Well, what's the difference? I could do that, and it might make it easier, but if you chose NASM, you shouldn't be expecting it to be easy. Unless there's any other reason, of course.