15
Daniel B.
Last seen 5 years ago
Member for 8 years, 9 months, 27 days
Difficulty Normal
Holy crap. That is almost reminiscent of Perl. I needed quite some time to understand that.
I like it.
More
"Well, that should be some simple line equations, that should be fairly easy..."
ZeroDivisionError!
"F* * k it, sort of obvious. Lets catch that error and if it occurs just switch the x- and y-axis. That should cover most cases..."
ZERO DIVISION ERROR !!!
"F* * k it, of course they test for that
More
Inspired by [Stackoverflow](https://stackoverflow.com/questions/6223285/shortest-python-quine)
More
inspired by [panaro32s](http://www.checkio.org/user/panaro32/) [solution](http://www.checkio.org/mission/counting-tiles/publications/panaro32/python-3/first/), but in a single line.
More
This might be improved upon by storing a list of guesses in a global variable (depending on how the check is facilitated). That way one could eliminate some obnoxious primes directly.
More
could have saved some whitespaces i guess.
Still looking for a shorter method to eval len(m)==1.
More
I just went ahead and labeled all distinct blobs and then determined the one with the most members. Probably not the most efficient thing ever, but it works well.
More
This looks like a beautiful solution, but I have absolutely no idea what's going on here. would you mind commenting on it a bit, especially on the 'transitions' function?
More
The idea with the sum is interesting, would not have thought of it but it didn't surprise me.
but
0*d==0 and[d]or X
blew my mind. I never thought of the boolean operators as being able to do branch-like operations without using an if statement.
More
Not pretty or clever but does the trick.
There is no special logic involved to cage in the chicken. Both Hobbits just take the shortest path to the chicken while seeing each other as obstacles.
Conflict resolution (both Hobbits want to step on the same square) is done by simply having the one on t
More
