NoCOUG Contest: the Perl Dark Horse Entry

May 31, 2012 / By Yanick Champoux

Tags: ,

So NoCOUG announced its third international SQL & NoSQL challenge (look at page 25 of that pdf) earlier this week. Yay!

As I did last year, I tried my hand at forging a Perl solution for the challenge. Just to, y’know, peer-pressure my colleagues a little into entering the fray.


As it happens, this week is a little…intense, $work-wise, so I wasn’t able to polish my solution into pure howling madness. But I daresay the work-in-progress that I have is still worth a few cackles, although you shouldn’t take my word for it. Here, I’ll let you be the judge of it:

die@$_ for
sort{@$a-@$b}map{$i=$_;[(Albus,Burdock,Carlotta,Daisy,Elfrida,
Falco)[grep$i&2**$_,0..5]]}grep{$x=$_;$x|=$f{$_}x($_==$_&$x)for
(%f=(1,6,4,9,16,7,32,12,12,50,3,8))x6;63==$x}1..63

And I just saw on the NoCOUG page that there is an additional rule document with some more attendance rules.

Hmm…

Looks like my job is not done, here…

One Response to “NoCOUG Contest: the Perl Dark Horse Entry”

  • […] Last time, I produced my traditional golfed solution for the annual NoCOUG contest. As I mentioned at the end, the actual challenge calls for a more generic solution than originally described in the magazine. Because there is no glory in half-solving a problem, I had to come back to it. And because the Great Karmic Balance could probably use it, I thought I could take advance of the broader scope to produces a solution more geared toward elegance and modernism. […]

Leave a Reply

  • (will not be published)

XHTML: You can use these tags: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <strike> <strong>