aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
Diffstat
-rw-r--r--challenge-163/athanasius/perl/ch-1.pl152
-rw-r--r--challenge-163/athanasius/perl/ch-2.pl174
-rw-r--r--challenge-163/athanasius/raku/ch-1.raku126
-rw-r--r--challenge-163/athanasius/raku/ch-2.raku154
4 files changed, 606 insertions, 0 deletions
diff --git a/challenge-163/athanasius/perl/ch-1.pl b/challenge-163/athanasius/perl/ch-1.pl
new file mode 100644
index 0000000000..d424f64254
--- /dev/null
+++ b/challenge-163/athanasius/perl/ch-1.pl
@@ -0,0 +1,152 @@
+#!perl
+
+###############################################################################
+=comment
+
+Perl Weekly Challenge 163
+=========================
+
+TASK #1
+-------
+*Sum Bitwise Operator*
+
+Submitted by: Mohammad S Anwar
+
+You are given list positive numbers, @n.
+
+Write script to calculate the sum of bitwise & operator for all unique pairs.
+
+Example 1
+
+ Input: @n = (1, 2, 3)
+ Output: 3
+
+ Since (1 & 2) + (2 & 3) + (1 & 3) => 0 + 2 + 1 => 3.
+
+Example 2
+
+ Input: @n = (2, 3, 4)
+ Output: 2
+
+ Since (2 & 3) + (2 & 4) + (3 & 4) => 2 + 0 + 0 => 2.
+
+=cut
+###############################################################################
+
+#--------------------------------------#
+# Copyright © 2022 PerlMonk Athanasius #
+#--------------------------------------#
+
+#==============================================================================
+=comment
+
+Assumptions
+-----------
+1. "Positive numbers" are integers greater than zero.
+2. "Unique pairs" are 2-combinations drawn from the *set* of input numbers,
+ since:
+ - the elements of each pair are distinct; and
+ - their order is irrelevant.
+
+=cut
+#==============================================================================
+
+use strict;
+use warnings;
+use Const::Fast;
+use List::MoreUtils qw( uniq );
+use Regexp::Common qw( number );
+
+const my $VERBOSE => 1;
+const my $USAGE =>
+"Usage:
+ raku ch-1.raku [<n> ...]
+
+ [<n> ...] A list of positive integers\n";
+
+#------------------------------------------------------------------------------
+BEGIN
+#------------------------------------------------------------------------------
+{
+ $| = 1;
+ print "\nChallenge 163, Task #1: Sum Bitwise Operator (Perl)\n\n";
+}
+
+#==============================================================================
+MAIN:
+#==============================================================================
+{
+ my @n = parse_command_line();
+
+ printf "Input: \@n = (%s)\n", join ', ', @n;
+
+ my $pairs = get_unique_pairs( \@n );
+ my @bitw_ands; # Bitwise ANDs in the same order as @$pairs
+
+ for my $pair (@$pairs)
+ {
+ my ($x, $y) = @$pair;
+
+ push @bitw_ands, $x & $y; # Perform the bitwise-AND operation
+ }
+
+ my $sum = 0;
+ $sum += $_ for @bitw_ands;
+
+ print "Output: $sum\n";
+
+ if ($VERBOSE && @$pairs)
+ {
+ my @pair_strs = map { sprintf "(%d & %d)", @$_ } @$pairs;
+
+ printf "\nSince %s => %s => %d\n", join( ' + ', @pair_strs ),
+ join( ' + ', @bitw_ands ), $sum;
+ }
+}
+
+#------------------------------------------------------------------------------
+sub get_unique_pairs
+#------------------------------------------------------------------------------
+{
+ my ($n) = @_;
+ my @nums = sort { $a <=> $b } uniq @$n;
+ my @pairs;
+
+ for my $i (0 .. $#nums - 1)
+ {
+ for my $j ($i + 1 .. $#nums)
+ {
+ push @pairs, [ @nums[ $i, $j ] ];
+ }
+ }
+
+ return \@pairs; # These are in sorted (ascending numerical) order
+}
+
+#------------------------------------------------------------------------------
+sub parse_command_line
+#------------------------------------------------------------------------------
+{
+ @ARGV or error( 'No command line arguments found' );
+
+ for my $n (@ARGV)
+ {
+ $n =~ / ^ $RE{num}{int} $ /x
+ or error( qq["$n" is not a valid integer] );
+
+ $n > 0 or error( qq["$n" is not positive] );
+ }
+
+ return @ARGV;
+}
+
+#------------------------------------------------------------------------------
+sub error
+#------------------------------------------------------------------------------
+{
+ my ($message) = @_;
+
+ die "ERROR: $message\n$USAGE";
+}
+
+###############################################################################
diff --git a/challenge-163/athanasius/perl/ch-2.pl b/challenge-163/athanasius/perl/ch-2.pl
new file mode 100644
index 0000000000..7748c3d1dc
--- /dev/null
+++ b/challenge-163/athanasius/perl/ch-2.pl
@@ -0,0 +1,174 @@
+#!perl
+
+###############################################################################
+=comment
+
+Perl Weekly Challenge 163
+=========================
+
+TASK #2
+-------
+*Summations*
+
+Submitted by: Mohammad S Anwar
+
+You are given a list of positive numbers, @n.
+
+Write a script to find out the summations as described below.
+
+Example 1
+
+ Input: @n = (1, 2, 3, 4, 5)
+ Output: 42
+
+ 1 2 3 4 5
+ 2 5 9 14
+ 5 14 28
+ 14 42
+ 42
+
+ The nth Row starts with the second element of the (n-1)th row.
+ The following element is sum of all elements except first element of previous
+ row.
+ You stop once you have just one element in the row.
+
+Example 2
+
+ Input: @n = (1, 3, 5, 7, 9)
+ Output: 70
+
+ 1 3 5 7 9
+ 3 8 15 24
+ 8 23 47
+ 23 70
+ 70
+
+=cut
+###############################################################################
+
+#--------------------------------------#
+# Copyright © 2022 PerlMonk Athanasius #
+#--------------------------------------#
+
+#==============================================================================
+=comment
+
+Assumption
+----------
+"Positive numbers" are integers greater than zero.
+
+=cut
+#==============================================================================
+
+use strict;
+use warnings;
+use Const::Fast;
+use Regexp::Common qw( number );
+
+const my $VERBOSE => 1;
+const my $USAGE =>
+"Usage:
+ perl $0 [<n> ...]
+
+ [<n> ...] A list of positive integers\n";
+
+#------------------------------------------------------------------------------
+BEGIN
+#------------------------------------------------------------------------------
+{
+ $| = 1;
+ print "\nChallenge 163, Task #2: Summations (Perl)\n\n";
+}
+
+#==============================================================================
+MAIN:
+#==============================================================================
+{
+ my @n = parse_command_line();
+
+ printf "Input: \@n = (%s)\n", join ', ', @n;
+
+ my @last = @n;
+ my @next = $last[ 1 ];
+ my @triangle = [ @last ];
+
+ while (scalar @last > 1)
+ {
+ push @next, $next[ $_ - 2 ] + $last[ $_ ] for 2 .. $#last;
+ push @triangle, [ @next ];
+
+ @last = @next;
+ @next = $last[ 1 ];
+ }
+
+ printf "Output: %d\n", $triangle[ -1 ][ 0 ];
+
+ display_triangle( \@triangle ) if $VERBOSE;
+}
+
+#------------------------------------------------------------------------------
+sub display_triangle
+#------------------------------------------------------------------------------
+{
+ my ($triangle) = @_;
+
+ # Pre-calculate the maximum width of each column
+
+ my @col_widths;
+
+ for my $col (0 .. $#{ $triangle->[ 0 ] })
+ {
+ $col_widths[ $col ] = length $triangle->[ $col ][ 0 ];
+ }
+
+ # Print the triangle
+
+ print "\n";
+ my $row_idx = 0;
+
+ for my $row (@$triangle)
+ {
+ print ' ';
+
+ for my $i (0 .. $row_idx - 1)
+ {
+ printf ' %*s', $col_widths[ $i ], '';
+ }
+
+ for my $j (0 .. $#$row)
+ {
+ printf ' %*s', $col_widths[ $j + $row_idx ], $row->[ $j ];
+ }
+
+ print "\n";
+ ++$row_idx;
+ }
+}
+
+#------------------------------------------------------------------------------
+sub parse_command_line
+#------------------------------------------------------------------------------
+{
+ @ARGV or error( 'No command line arguments found' );
+
+ for (@ARGV)
+ {
+ / ^ $RE{num}{int} $ /x
+ or error( qq["$_" is not a valid integer] );
+
+ $_ > 0 or error( qq["$_" is not positive] );
+ }
+
+ return @ARGV;
+}
+
+#------------------------------------------------------------------------------
+sub error
+#------------------------------------------------------------------------------
+{
+ my ($message) = @_;
+
+ die "ERROR: $message\n$USAGE";
+}
+
+###############################################################################
diff --git a/challenge-163/athanasius/raku/ch-1.raku b/challenge-163/athanasius/raku/ch-1.raku
new file mode 100644
index 0000000000..b46d054d9a
--- /dev/null
+++ b/challenge-163/athanasius/raku/ch-1.raku
@@ -0,0 +1,126 @@
+use v6d;
+
+###############################################################################
+=begin comment
+
+Perl Weekly Challenge 163
+=========================
+
+TASK #1
+-------
+*Sum Bitwise Operator*
+
+Submitted by: Mohammad S Anwar
+
+You are given list positive numbers, @n.
+
+Write script to calculate the sum of bitwise & operator for all unique pairs.
+
+Example 1
+
+ Input: @n = (1, 2, 3)
+ Output: 3
+
+ Since (1 & 2) + (2 & 3) + (1 & 3) => 0 + 2 + 1 => 3.
+
+Example 2
+
+ Input: @n = (2, 3, 4)
+ Output: 2
+
+ Since (2 & 3) + (2 & 4) + (3 & 4) => 2 + 0 + 0 => 2.
+
+=end comment
+###############################################################################
+
+#--------------------------------------#
+# Copyright © 2022 PerlMonk Athanasius #
+#--------------------------------------#
+
+#==============================================================================
+=begin comment
+
+Assumptions
+-----------
+1. "Positive numbers" are integers greater than zero.
+2. "Unique pairs" are 2-combinations drawn from the *set* of input numbers,
+ since:
+ - the elements of each pair are distinct; and
+ - their order is irrelevant.
+
+=end comment
+#==============================================================================
+
+subset Pos of Int where * > 0;
+
+my Bool constant $VERBOSE = True;
+
+#------------------------------------------------------------------------------
+BEGIN
+#------------------------------------------------------------------------------
+{
+ "\nChallenge 163, Task #1: Sum Bitwise Operator (Raku)\n".put;
+}
+
+#==============================================================================
+sub MAIN
+(
+ *@n where { +@n > 0 && .all ~~ Pos:D } #= A list of positive integers
+)
+#==============================================================================
+{
+ "Input: @n = (%s)\n".printf: @n.join: ', ';
+
+ my Array[UInt] @pairs = get-unique-pairs( @n );
+ my UInt @bitw-ands; # Bitwise ANDs in the same order as @pairs
+
+ for @pairs -> Array[UInt] $pair
+ {
+ my Pos ($x, $y) = @$pair;
+
+ @bitw-ands.push: $x +& $y; # Perform the bitwise-AND operation
+ }
+
+ my UInt $sum = [+] @bitw-ands;
+
+ "Output: $sum".put;
+
+ if $VERBOSE && +@pairs
+ {
+ my Str @pair-strs = @pairs.map: { "(%d & %d)".sprintf: @$_ };
+
+ "\nSince %s => %s => %d\n".printf: @pair-strs.join( ' + ' ),
+ @bitw-ands.join( ' + ' ), $sum;
+ }
+}
+
+#------------------------------------------------------------------------------
+sub get-unique-pairs( Array:D[Pos:D] $n --> Array:D[Array:D[UInt:D]] )
+#------------------------------------------------------------------------------
+{
+ my Array[UInt] @pairs;
+ my Pos @nums = $n.unique.sort;
+
+ for 0 .. @nums.end - 1 -> UInt $i
+ {
+ for $i + 1 .. @nums.end -> UInt $j
+ {
+ @pairs.push: Array[UInt].new: @nums[ $i, $j ];
+ }
+ }
+
+ return @pairs; # These are in sorted (ascending numerical) order
+}
+
+#------------------------------------------------------------------------------
+sub USAGE()
+#------------------------------------------------------------------------------
+{
+ my Str $usage = $*USAGE;
+
+ $usage ~~ s/ ($*PROGRAM-NAME) /raku $0/;
+
+ $usage.put;
+}
+
+##############################################################################
diff --git a/challenge-163/athanasius/raku/ch-2.raku b/challenge-163/athanasius/raku/ch-2.raku
new file mode 100644
index 0000000000..cb3fdd0855
--- /dev/null
+++ b/challenge-163/athanasius/raku/ch-2.raku
@@ -0,0 +1,154 @@
+use v6d;
+
+###############################################################################
+=begin comment
+
+Perl Weekly Challenge 163
+=========================
+
+TASK #2
+-------
+*Summations*
+
+Submitted by: Mohammad S Anwar
+
+You are given a list of positive numbers, @n.
+
+Write a script to find out the summations as described below.
+
+Example 1
+
+ Input: @n = (1, 2, 3, 4, 5)
+ Output: 42
+
+ 1 2 3 4 5
+ 2 5 9 14
+ 5 14 28
+ 14 42
+ 42
+
+ The nth Row starts with the second element of the (n-1)th row.
+ The following element is sum of all elements except first element of previous
+ row.
+ You stop once you have just one element in the row.
+
+Example 2
+
+ Input: @n = (1, 3, 5, 7, 9)
+ Output: 70
+
+ 1 3 5 7 9
+ 3 8 15 24
+ 8 23 47
+ 23 70
+ 70
+
+=end comment
+###############################################################################
+
+#--------------------------------------#
+# Copyright © 2022 PerlMonk Athanasius #
+#--------------------------------------#
+
+#==============================================================================
+=begin comment
+
+Assumption
+----------
+"Positive numbers" are integers greater than zero.
+
+=end comment
+#==============================================================================
+
+subset Pos of Int where * > 0;
+
+my Bool constant $VERBOSE = True;
+
+#------------------------------------------------------------------------------
+BEGIN
+#------------------------------------------------------------------------------
+{
+ "\nChallenge 163, Task #2: Summations (Raku)\n".put;
+}
+
+#==============================================================================
+sub MAIN
+(
+ *@n where { +@n > 0 && .all ~~ Pos:D } #= A list of positive integers
+)
+#==============================================================================
+{
+ "Input: @n = (%s)\n".printf: @n.join: ', ';
+
+ my Pos @last = @n.map: { .Int };
+ my Pos @next = @last[ 1 ];
+ my Array[Pos] @triangle;
+ @triangle.push: @last.clone;
+
+ while +@last > 1
+ {
+ for 2 .. @last.end -> UInt $i
+ {
+ @next.push: @next[ $i - 2 ] + @last[ $i ];
+ }
+
+ @triangle.push: @next.clone;
+
+ @last = @next;
+ @next = @last[ 1 ];
+ }
+
+ "Output: %d\n".printf: @triangle[ *-1; 0 ];
+
+ display-triangle( @triangle ) if $VERBOSE;
+}
+
+#------------------------------------------------------------------------------
+sub display-triangle( Array:D[Array:D[Pos:D]] $triangle )
+#------------------------------------------------------------------------------
+{
+ # Pre-calculate the maximum width of each column
+
+ my UInt @col-widths;
+
+ for 0 .. $triangle[ 0 ].end -> $col
+ {
+ @col-widths[ $col ] = $triangle[ $col; 0 ].chars;
+ }
+
+ # Print the triangle
+
+ put();
+ my UInt $row-idx = 0;
+
+ for @$triangle -> Array[Pos] $row
+ {
+ ' '.print;
+
+ for 0 .. $row-idx - 1 -> UInt $i
+ {
+ ' %*s'.printf: @col-widths[ $i ], '';
+ }
+
+ for 0 .. $row.end -> UInt $j
+ {
+ ' %*s'.printf: @col-widths[ $j + $row-idx ], $row[ $j ];
+ }
+
+ put();
+ ++$row-idx;
+ }
+}
+
+#------------------------------------------------------------------------------
+sub USAGE()
+#------------------------------------------------------------------------------
+{
+ my Str $usage = $*USAGE;
+
+ $usage ~~ s/ ($*PROGRAM-NAME) /raku $0/;
+
+ $usage.put;
+}
+
+##############################################################################
generated by cgit (git 2.34.1) at 2026-06-30 20:44:48 +0000