diff options
| author | Scimon Proctor <simon.proctor@gmail.com> | 2021-08-06 09:42:29 +0100 |
|---|---|---|
| committer | Scimon Proctor <simon.proctor@gmail.com> | 2021-08-06 09:42:29 +0100 |
| commit | a8d0fe22140f3e572fb12a73480cab684cd47388 (patch) | |
| tree | 5c4d3adb5faa37e30c5707162cb668de704284a1 | |
| parent | c1646be90db79f876b0bafed002c3976333ee540 (diff) | |
| download | perlweeklychallenge-club-a8d0fe22140f3e572fb12a73480cab684cd47388.tar.gz perlweeklychallenge-club-a8d0fe22140f3e572fb12a73480cab684cd47388.tar.bz2 perlweeklychallenge-club-a8d0fe22140f3e572fb12a73480cab684cd47388.zip | |
Finally got Challenge 2 working
| -rw-r--r-- | challenge-124/simon-proctor/raku/ch-2.raku | 15 |
1 files changed, 15 insertions, 0 deletions
diff --git a/challenge-124/simon-proctor/raku/ch-2.raku b/challenge-124/simon-proctor/raku/ch-2.raku new file mode 100644 index 0000000000..7f6e57d0b8 --- /dev/null +++ b/challenge-124/simon-proctor/raku/ch-2.raku @@ -0,0 +1,15 @@ +#!/usr/bin/env raku + +#| Given a list of up to 20 elements find the division of items that has the smallest difference +sub MAIN( *@N where @N.elems <= 20 ) { + my $len = @N.elems div 2; + + my @res = @N.combinations($len).map( -> @a { ( @a, (@N (-) @a).keys ) } ) + .sort(-> (@a,@b) {abs( ([+] @a) - ([+] @b)) } ) + .first; + + "{@res[0].join(',')} <=> {@res[1].join(',')}".say; + + +} + |