From e2c8b4bec3b682df8597f57ec627508a07582d31 Mon Sep 17 00:00:00 2001 From: 冯昶 Date: Tue, 11 Apr 2023 22:08:10 +0800 Subject: challenge 212, raku solutions --- challenge-212/feng-chang/raku/ch-1.raku | 27 +++++++++++++++++++++++++++ challenge-212/feng-chang/raku/ch-2.raku | 21 +++++++++++++++++++++ 2 files changed, 48 insertions(+) create mode 100755 challenge-212/feng-chang/raku/ch-1.raku create mode 100755 challenge-212/feng-chang/raku/ch-2.raku diff --git a/challenge-212/feng-chang/raku/ch-1.raku b/challenge-212/feng-chang/raku/ch-1.raku new file mode 100755 index 0000000000..601fa71045 --- /dev/null +++ b/challenge-212/feng-chang/raku/ch-1.raku @@ -0,0 +1,27 @@ +#!/bin/env raku + +unit sub MAIN(*@N); + +sub USAGE() { + print Q:c:to/END/; + Usage: {$*PROGRAM-NAME} ... + Word should contain alphabetic characters only, and + the number of integers should be equal to word length. + END +} + +if +@N == 0 or + @N[0] !~~ /^ <[a..z A..Z]>+ $/ or + @N[0].chars !== +@N - 1 { + USAGE(); + exit 1; +} + +my method jump-characters(Str:D $c : UInt:D $n --> Str:D) { + given $c { + when 'a'..'z' { chr((ord($c) - ord('a') + $n) % 26 + ord('a')) } + when 'A'..'Z' { chr((ord($c) - ord('A') + $n) % 26 + ord('A')) } + } +} + +put @N[0].comb.pairs.map({ .value.&jump-characters(@N[.key + 1]) }).join; diff --git a/challenge-212/feng-chang/raku/ch-2.raku b/challenge-212/feng-chang/raku/ch-2.raku new file mode 100755 index 0000000000..100c4e13b1 --- /dev/null +++ b/challenge-212/feng-chang/raku/ch-2.raku @@ -0,0 +1,21 @@ +#!/bin/env raku + +unit sub MAIN(*@N, Int:D :$size); + +my $bag = @N».Int.Bag; +my @groups; + +while +$bag { + my $k = $bag.keys.min; + my $g = ($k .. ($k + $size - 1)).Bag; + + if $g (<=) $bag { + $bag (-)= $g; + @groups.push($g.keys.sort); + } else { + put -1; + exit 1; + } +} + +put @groups.map({ '(' ~ .join(',') ~ ')' }).join(', '); -- cgit