Name:Mateen Ulhaq
Clan:Simon Fraser University
Skills:python, numpy, c++, c#, haskell, rust, bash, kotlin, lisp, fortran, matlab, tensorflow, java, android, javascript, perl, vhdl, verilog, vimscript, mathematics, physics, image processing, deep learning
Following:79
Followers:75
Allies:73
In retrospect, this was a pretty stupid way to approach the problem...
This comment is hidden because it contains spoiler information about the solution
Wait... I thought this was Fortran. I don't even know why. This is pretty embarrassing.
Oooh. Scala's pattern match-lambda (?) syntax looks neat.
This comment is hidden because it contains spoiler information about the solution
This is very pretty.
I could swear that I tried that...
This comment is hidden because it contains spoiler information about the solution
Well... I got it to 29. :)
This comment is hidden because it contains spoiler information about the solution
This comment is hidden because it contains spoiler information about the solution
This comment is hidden because it contains spoiler information about the solution
Whoops, forgot to define
symm = swapinstead.Which makes it really nice that
isoSymm = (symm, symm)!nomnomnomnom...! :DClever exploitation of the fact that our data consists purely of small integers!
I wish
numpyhad aargpartitionfor 2-keys.lexsortcomes close, but it's a full-fledgedsortand has the annoying additional requirement of named arrays. Which makes my solution look... uglier than otherwise.