Ad
  • Custom User Avatar

    What is the best time complexity one could achieve? Mine is O(n^(3/2)) and I still couldn't make it through the time limits.

  • Custom User Avatar

    NASM translation, please review carefully.

  • Custom User Avatar

    This comment is hidden because it contains spoiler information about the solution

  • Custom User Avatar

    I suggest to add a fixed test for numbers 1 to 100 (or 1000). Reason: I completed the kata in ruby & python with an incorrect algo, which fails already at 43, 67, etc...

  • Custom User Avatar

    Well, do you think it is possible to pass the tests without the math background that i don't have, (i have near no math education) ?

    Is there any clever other trick that would make a python implementation able to pass the tests without timeouts ?

    I don't find any more optimization i could bring to my ignorant "brute force" approach of this problem :(

    Is there some wikipedia math info that i could study that would hint me ?