Sort answers by score snippet
This is a version 1 2 of a snippet that can sort and list all answers to a question in increasing order of the score.
This snippet recognizes various different style of answer headings, but suggestions welcome for the ones which are missed out by the snippet.
The ...
Here is a simple, bite-sized (byte-sized?) code golf: given a non-empty list of positive integers less than 10, print a block-diagonal matrix, where the list specifies the size of the blocks, in order. The blocks must consist of positive integers less than 10. So if you're given as input
[5 1 1 ...
btw, I tried your matrix approach in mathematica, but surprisingly both creating tridiagonal matrices and matrix powers are really cumbersome (from a golfing perspective). I think matlab should actually beat mathematica with this.
Here's an idea for a Rosetta Stone scoring rule: each langiage is its own mini-golf competition, for each language category you win, you gain a number of points equal to the number of entrants in that language.
I'm thinking of doing a "pretty-print a tree" challenge somewhat similar to this (additionally requiring that edges are non-crossing straight lines), but I can't decide a scoring system. Pure golf, aesthetics-based popcon, or a challenge to cram the tree in as small a space as possible...
The troll face in the chat caught my eye and so I read his profile and it reads "I usually try to avoid using third-party libraries; I code my own ones instead if possible in a reasonable amount of code & time."
Anyway, if that troll face guy ever ends up working for some companies, they'll be required to use third party libraries in order to remain STIG compliant.
Another thing is using Commons just for FileUtils.copyFile, since while Java has no one-method way for this it is extremely simple to do with Channels.
Whoah. I've never seen FileChannel before. This is cool: "attempts to initiate a second such operation while the first is still in progress will block until the first operation completes"
That reminds me, I need to write a controller for a deadlock KotH challenge that has been sitting in the sandbox for ages.
Maybe I can use files as forks
And the players can be philosophers
Some smartass will find a way to eat his dinner without waiting for both forks though, and ruin the challenge.
About the Series
First off, you may treat this like any other code golf challenge, and answer it without worrying about the series at all. However, there is a leaderboard across all challenges. You can find the leaderboard along with some more information about the series in the first post.
Alt...
I tried to use Google to get a grasp on what I'll be working on the next three weeks. So I searched for "high availability padawans jedi master cli" and got a page about Yoda.
A Google search reveals plenty about generating all possible partitions of an integer n into m parts, but I haven't found anything about sampling a uniformly distributed random partition of n into m parts.
@MartinBüttner Would it be okay if the distribution is only asymptotically equal? E.g. if for small values of n a slight skew might exist that vanishes as n goes to infinity?
> Mapping a uniform distribution over a larger range onto a smaller range via modulo. The larger range has to contain at least 1024 times as many possible values as the smaller range.
@Geobits how do you uniformly map a smaller range to a larger? if you map n values onto m values for n < m, then you'll only ever hit n distinct of the m values, no?
@FUZxxl there's no need to approximate anything for a polynomial solution
For instance, floor(random()*10) (where random() returns 0-1) returns one of ten values from many more than 10 possibilities. So the range has more values, but a smaller absolute range.
@TheBestOne would you mind including a link to ideone with a little test framework, where I can generate a number of partitions at once? I don't Java much.
Sort answers by score snippet
This is a version 1 2 of a snippet that can sort and list all answers to a question in increasing order of the score.
This snippet recognizes various different style of answer headings, but suggestions welcome for the ones which are missed out by the snippet.
The ...
A Google search reveals plenty about generating all possible partitions of an integer n into m parts, but I haven't found anything about sampling a uniformly distributed random partition of n into m parts.
