Challenge 269 by Jaldhar H. Vyas.

5 files changed, 78 insertions, 0 deletions

diff --git a/challenge-269/jaldhar-h-vyas/blog.txt b/challenge-269/jaldhar-h-vyas/blog.txt
new file mode 100644
index 0000000000..013239cfd7
--- /dev/null
+++ b/challenge-269/jaldhar-h-vyas/blog.txt
@@ -0,0 +1 @@
+https://www.braincells.com/perl/2024/05/perl_weekly_challenge_week_269.html
diff --git a/challenge-269/jaldhar-h-vyas/perl/ch-1.pl b/challenge-269/jaldhar-h-vyas/perl/ch-1.pl
new file mode 100755
index 0000000000..d9b2247d7c
--- /dev/null
+++ b/challenge-269/jaldhar-h-vyas/perl/ch-1.pl
@@ -0,0 +1,45 @@
+#!/usr/bin/perl
+use v5.38;
+
+sub bitwiseOR($listref) {
+    my @list = @{$listref};
+
+   my $result = shift @list;
+   for my $elem (@list) {
+      $result |= $elem;
+   }
+
+   return $result;
+}
+
+sub combinations($listref, $length) {
+    my @list = @{$listref};
+
+    if ($length <= 1) {
+        return map [$_], @list;
+    }
+
+    my @combos;
+
+    for (my $i = 0; $i + $length <= scalar @list; $i++) {
+        my $val  = $list[$i];
+        my @rest = @list[$i + 1 .. $#list];
+        for my $c (combinations(\@rest, $length - 1)) {
+            push @combos, [$val, @{$c}] ;
+        }
+    }
+
+    return @combos;
+}
+
+my @ints = @ARGV;
+
+for my $i (2 .. scalar @ints) {
+   for my $combo (combinations(\@ints, $i)) {
+      if ((split //, sprintf("%b", bitwiseOR($combo)))[-1] == '0') {
+         say 'true';
+         exit(0);
+      }
+   }
+}
+say 'false';
\ No newline at end of file
diff --git a/challenge-269/jaldhar-h-vyas/perl/ch-2.pl b/challenge-269/jaldhar-h-vyas/perl/ch-2.pl
new file mode 100755
index 0000000000..d0b07ef27e
--- /dev/null
+++ b/challenge-269/jaldhar-h-vyas/perl/ch-2.pl
@@ -0,0 +1,16 @@
+#!/usr/bin/perl
+use v5.38;
+
+my @ints = @ARGV;
+my @arr1 = shift @ints;
+my @arr2 = shift @ints;
+for my $k (keys @ints) {
+    if ($arr1[-1] > $arr2[-1]) { 
+        push @arr1, $ints[$k];
+     } else {
+        push @arr2, $ints[$k];
+     }
+}
+push @arr1, @arr2;
+
+say q{(}, (join q{, }, @arr1), q{)};
diff --git a/challenge-269/jaldhar-h-vyas/raku/ch-1.sh b/challenge-269/jaldhar-h-vyas/raku/ch-1.sh
new file mode 100755
index 0000000000..2d20ffeb12
--- /dev/null
+++ b/challenge-269/jaldhar-h-vyas/raku/ch-1.sh
@@ -0,0 +1,3 @@
+#!/bin/sh
+
+raku -e 'say @*ARGS.combinations(2..@*ARGS.elems).grep({([+|] @$_).base(2).ends-with(0)}).elems > 0' "$@"
diff --git a/challenge-269/jaldhar-h-vyas/raku/ch-2.raku b/challenge-269/jaldhar-h-vyas/raku/ch-2.raku
new file mode 100755
index 0000000000..e2388660b7
--- /dev/null
+++ b/challenge-269/jaldhar-h-vyas/raku/ch-2.raku
@@ -0,0 +1,13 @@
+#!/usr/bin/raku
+
+sub MAIN(
+    *@ints
+) {
+    my @arr1 = @ints.shift;
+    my @arr2 = @ints.shift;
+    for @ints.keys -> $k {
+        @arr1[*-1] > @arr2[*-1] ?? @arr1.push(@ints[$k]) !! @arr2.push(@ints[$k]);
+    }
+
+    say q{(},  @arr1.push(| @arr2).join(q{, }), q{)};
+}
\ No newline at end of file