Юбилейчик
http://irclog.perlgeek.de/parrot/2009-0
Приблизительно соответсвует количеству коммитов в Parrot :)
Приблизительно соответсвует количеству коммитов в Parrot :)
Monday, March 16th, 2009
![[info]](http://l-stat.livejournal.com/img/userinfo.gif){kind=small}
Wednesday, December 24th, 2008
Happy hacking (3)
Beginner's events are way too easy. Let's take a look at "advanced".
http://www.microsoft.com/technet/script
In a nutshell we build mapping between number and word.
Funny note: there is no 'scripts' in wordlist.txt :)
http://www.microsoft.com/technet/script
In a nutshell we build mapping between number and word.
use Test;
# Build letters-to-digits map
my $pos = 2;
my %l2d;
map { %l2d{$^a} = $pos; %l2d{$^b} = $pos; %l2d{$^c} = $pos++ }, 'a'..'p', 'r'..'y';
# Calculate number representation of word
sub read_word($word) {
# join digit for given letters
[~] map { %l2d{ lc $^a } }, $word.split('');
};
# Read wordlist and returns hash (number => word).
# Also skips all non-7 chars words
sub read_wordlist($filename) {
my $fh = open($filename) or die;
map { read_word($^a) => $^a }, grep { $^a.chars == 7 }, =$fh;
};
my %words = read_wordlist('wordlist.txt');
for <727-4787 732-34-64> {
my $key = $_.subst('-', '', :g);
say uc %words{$key};
}
{
plan 2;
is('7274787', read_word('SCRIPTS'), 'SCRIPTS passed');
is('7323465', read_word('READING'), 'READING passed');
}
# vim: ft=perl6
Funny note: there is no 'scripts' in wordlist.txt :)
Happy hacking (2)
Beginner Event 2: True Type
/me vomited looking on proposed solution by MS guys...
sub calculate_truetype(@fonts) {
my @truetypes = grep { $^a ~~ /\(TrueType\) $/ }, @fonts;
say join("\n", @truetypes);
say "";
say "TrueType: " ~ +@truetypes;
say "Total: " ~ +@fonts;
};
/me vomited looking on proposed solution by MS guys...
Happy hacking :)
In response to http://use.perl.org/~pmichaud/journal/3
Solution for 2008 Beginner Event 1: Pairing Off
Solution for 2008 Beginner Event 1: Pairing Off
use Test;
plan 4;
sub fact($n) {
$n <= 1 ?? 1 !! $n*fact($n-1);
}
sub calculate_pairs(@pairs) {
my %h;
# Calculate number of distinct cards.
++%h{$_} for @pairs;
# Sum of C^N_2
[+] map { int(fact($^a) / 2) }, %h.values;
};
{
is( 0, calculate_pairs(<1 2 3 4 5>));
is( 2, calculate_pairs(<2 4 4 Q Q>));
is( 3, calculate_pairs(<3 3 3 10 A>));
is( 3, calculate_pairs(<7 5 7 7 K>));
}