This comment is hidden because it contains spoiler information about the solution
Well, this is kinda a duh moment for me... I did an iteration version which is wildly unnecessary, if you see this one. If anyone is still wondering how it works, it uses integer division to round down to the nearest whole number before multiplying by the divisor to get the complement.
Should be updated to Rust 1.49.
this doesnt seem to work on a calculator
C# translation. Please, review and approve (the author may be inactive).
C++ translation. Please, review and approve (the author may be inactive).
I forked his translation to update it to Rust 1.44 .
I also moved the reference solution to the test module
Can someone explain this sorcery?
Some language versions doesn't have random tests.
Y'all need to use parentheses.
"Turn a trivial math problem into a program" is neither new nor interesting kata idea.