Ad
  • Custom User Avatar
  • Custom User Avatar

    It is necessary to add to the condition that the Euclidean distance must be rounded down before comparing with the radius, otherwise this was not initially described in any way.

  • Custom User Avatar

    Description is unclear and one cannot figure out what he is supposed to do from the very poor basic tests. Euclidean distance implies continuous (non integer) values, so we don't know how we're supposed to calculate the number of characters to fill. Please state clearly what we're supposed to do, or at least add more basic tests.

  • Custom User Avatar

    Add -Wincomplete-patterns, -Werror=incomplete-patterns GHC flags.
    It will make some unfair tricks unavailable.

  • Custom User Avatar

    Can anyone help me with generating testcases with random types? Template Haskell may make this possible, but I don't know Template Haskell.

    This seemed like a good place to find people who know it though. :P

    This question concerns a prospective Haskell translation of Join until impossible. I have posted this question there, as well as on several CodeWars Gitter fora. Feel free to react anywhere.

  • Custom User Avatar

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

  • Custom User Avatar

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

  • Custom User Avatar

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

  • Custom User Avatar

    Is the trailing new line really necessary?