Loading collection data...
Collections are a way for you to organize kata so that you can create your own training routines. Every collection you create is public and automatically sharable with other warriors. After you have added a few kata to a collection you and others can train on the kata contained within the collection.
Get started now by creating a new collection.
I meant that the two strings in the test runner are static, so only available to that compilation unit.
Are the two strings supposed to be static? Cause then they can't be accessed in the separate NASM module that we're writing as far as I can tell
This comment is hidden because it contains spoiler information about the solution
You are basically brute-forcing the issue. By using the hint given in the descrption you can get a huge reduction in the possible solution space.
Because the instructions stated not to use dam or Hm.
This was probably to simplify the problem.
I have updated the description. Hope it helps.
Vector direction is important. In this example it goes downwards, so the point is to the right of tge vector. Let me know if you need more detailed explanation.
Just got
point = [-6015, 3783]
andvector = [[-1639, 9654], [-1263, 4157]]
as a random test case. Seems pretty obvious that the point is left of the line segment. This graph makes that evident. Am I misinterpretting the question? The way I see it, it's asking if the point is left/right/on the line if the given line segment were extended infinitely in both directions.This comment is hidden because it contains spoiler information about the solution
Why would
'999m'
be prefered over'9.99hm'
?This would actually be a really good problem to help people get comfortable with recursion. Recursion was the first way I thought of solving this, I didn't realize until after submitting and seeing the other solutions that there was a constant depth to the nesting.
I feel like this would be even more interesting if it could flatten nested lists. For example:
I feel like this should be able to be accomplished using reduce and recursion somehow, but I can't think of how without typechecking :/
This comment is hidden because it contains spoiler information about the solution
Loading more items...