Quite a difficult kata to be honest.

Unfortunately, we had to postpone this task for some time due to the lack of solution options. Perhaps I’ll come back to it when ideas for “simplifying” the algorithm appear.

I failed "random tests" and "more tests" with "nosuchelement exception"(i use Collections and Map). I have no idea what's wrong, because i checked this code in IDE in interval 1 to 2 billions and it works fine. What could happen?

Resolved by new fork.

Approved.

proper assertion messages for C (solves this issue)

performance tag should be added

C translation does not/ambiguously show actual and expected values in case of failure:

The expression (strongest_even(2085422641, 2128923730)) == (2113929216) is false.

random tests:

The expression (actual) == (expected) is false

C#: method name should be PascalCase (Please refer to implementation of backward compatibility here )

so my code works for the tests, but fails for the attempt, seems like my code is timing out? lol damn seems like the test values are prety high...

I just use python to express the algorithm ,however,it turns to be time-consuming.T^T

OP solved it, closing