Ad
  • Custom User Avatar

    your & is composed of 7 signals, while in theory, following the binary search tree in the wiki article, there can only be 6 signals at a maximum.

  • Custom User Avatar

    sorry, i commented on this thread by error.

  • Custom User Avatar

    In Python, sample test has the bits wrong, and not in the same format as announced by either the kata text nor as the tests of the attempt.

  • Custom User Avatar

    You have to be kidding me. Seriously? I didn't need to make the programming for which combinations of .s and -es mean which character?!

  • Custom User Avatar

    Could you specify what's the relation between patterns and special characters?, because your tests don't seem to use the characters shown in the International Morse code binary search tree as shown on the link you provided.

  • Custom User Avatar

    Okay, got another problem, when I simplify this to a bit by bit problem, I run into the 2^66 numbers problem again.
    Because every matrix always give me at least a pair of rectangular matrixes, and that way lies O(2^n)

  • Custom User Avatar

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

  • Custom User Avatar

    I just found out from the tests that there are 64 bit numbers involved. This should use O(cnt), else it's not possible to make it.

  • Custom User Avatar

    Is the order of the triplets (between triplets, not between letters in the triplets) intentional or could they be randomly ordered?

  • Custom User Avatar

    Python.
    I think it's important to say that n is the number of vertices the polygon has.
    If the above is true, then the phrasing 'For n=2, possible_triangulations(2) returns 2,' Doesn't make any sense. To return 2, n should be 4; and when n = 2, it should return 'Not a valid polygon'.

  • 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

    Trying with Python. I used numpy but apparently numpy doesn't parse 35 bit numbers. Tried again with a recursive formula but the server doesn't support more recursivity than 6 deep.
    I think I'm gonna have to precalculate the matrix up to 50 bits and then apply the loss and module, that might make it fast enough.
    Maybe use the fractal properties of the matrix...