From 59a313716661df0f7f023144d39c5f7108ca0050 Mon Sep 17 00:00:00 2001
From: boblied <boblied@gmail.com>
Date: Fri, 30 Oct 2020 17:14:58 -0500
Subject: Solution PWC 084 Task 1 Reverse Integer

---
 challenge-084/bob-lied/perl/ch-1.pl | 45 +++++++++++++++++++++++++++++++++++++
 1 file changed, 45 insertions(+)
 create mode 100644 challenge-084/bob-lied/perl/ch-1.pl

diff --git a/challenge-084/bob-lied/perl/ch-1.pl b/challenge-084/bob-lied/perl/ch-1.pl
new file mode 100644
index 0000000000..2a53636592
--- /dev/null
+++ b/challenge-084/bob-lied/perl/ch-1.pl
@@ -0,0 +1,45 @@
+#!/usr/bin/env perl
+# vim:set ts=4 sw=4 sts=4 et ai wm=0 nu:
+#=============================================================================
+# ch-1.pl
+#=============================================================================
+# Copyright (c) 2020, Bob Lied
+#=============================================================================
+# Perl Weekly Challenge 084 Task #1 > Reverse Integer
+#=============================================================================
+# You are given an integer $N.
+# Write a script to reverse the given integer and print the result.
+# Print 0 if the result doesn’t fit in 32-bit signed integer.
+# The number 2,147,483,647 is the maximum positive value for a 32-bit signed binary integer in computing.
+
+use strict;
+use warnings;
+use v5.30;
+
+use experimental qw/ signatures /;
+
+
+sub Usage { "Usage: $0 args" };
+
+my $N = shift;
+
+die Usage() unless $N;
+
+my $sign = 1;
+if ( $N < 0 )
+{
+    $sign = -1;
+    $N = -$N;
+}
+
+# Adding 0 forces numeric, drops leading zeroes.
+my $revN = 0 + reverse($N);
+
+if ( ($revN > 0x7fffffff) )
+{
+    say 0;
+}
+else
+{
+    say $sign * $revN;
+}
-- 
cgit 


From f982e2fa38562e5a3af7ac3469070a49284e438b Mon Sep 17 00:00:00 2001
From: Mark Anderson <mark@frontrangerunner.com>
Date: Sun, 1 Nov 2020 22:41:57 -0700
Subject: Challenge 85 Solutions (Raku)

---
 challenge-085/mark-anderson/raku/ch-1.p6 | 21 +++++++++++++++++++++
 challenge-085/mark-anderson/raku/ch-2.p6 | 31 +++++++++++++++++++++++++++++++
 2 files changed, 52 insertions(+)
 create mode 100644 challenge-085/mark-anderson/raku/ch-1.p6
 create mode 100644 challenge-085/mark-anderson/raku/ch-2.p6

diff --git a/challenge-085/mark-anderson/raku/ch-1.p6 b/challenge-085/mark-anderson/raku/ch-1.p6
new file mode 100644
index 0000000000..3ab0ac888f
--- /dev/null
+++ b/challenge-085/mark-anderson/raku/ch-1.p6
@@ -0,0 +1,21 @@
+multi MAIN(*@R where .all ~~ Real) {
+    say triplet-sum(@R)
+}
+ 
+multi MAIN {
+    use Test;
+    plan 3;
+
+    ok triplet-sum([1.2, 0.4, 0.1, 2.5]) == 1, "Example 1";
+    ok triplet-sum([0.2, 1.5, 0.9, 1.1]) == 0, "Example 2";
+    ok triplet-sum([0.5, 1.1, 0.3, 0.7]) == 1, "Example 3";
+}
+   
+sub triplet-sum(@R) {
+    @R.grep(0 < * < 2)
+      .combinations(3)
+      .map(*.sum)
+      .first(1 < * < 2)
+      .Bool 
+      .UInt 
+}
diff --git a/challenge-085/mark-anderson/raku/ch-2.p6 b/challenge-085/mark-anderson/raku/ch-2.p6
new file mode 100644
index 0000000000..a996c544f5
--- /dev/null
+++ b/challenge-085/mark-anderson/raku/ch-2.p6
@@ -0,0 +1,31 @@
+multi MAIN(UInt $N where * > 0) {
+    say uint-log($N)
+}
+
+multi MAIN {
+    use Test;
+    plan 9;
+
+    my @pairs = 1        => 1,   
+                2        => 0,      
+                8        => 1,       
+                15       => 0, 
+                125      => 1, 
+                126      => 0, 
+                1024*8   => 1, 
+                1024*8+1 => 0,
+                2**33    => 1;
+
+    for @pairs -> $pair {
+        ok uint-log($pair.key) == $pair.value, ($pair).fmt("%10d --> %d")
+    }
+}
+    
+sub uint-log(UInt $N) {    
+    return 1 if $N == 1;
+
+    (2..$N.sqrt.floor).map({ $N.log: $_ })
+                      .first({ .narrow ~~ UInt })
+                      .Bool
+                      .UInt;
+}
-- 
cgit 


From b8219fabfe59e7d169fb6942621c5d6a82eb0ee8 Mon Sep 17 00:00:00 2001
From: Mark Anderson <mark@frontrangerunner.com>
Date: Sun, 1 Nov 2020 22:59:29 -0700
Subject: Challenge 85 Solutions (Raku)

---
 challenge-085/mark-anderson/raku/ch-2.p6 | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/challenge-085/mark-anderson/raku/ch-2.p6 b/challenge-085/mark-anderson/raku/ch-2.p6
index a996c544f5..e00f687a3f 100644
--- a/challenge-085/mark-anderson/raku/ch-2.p6
+++ b/challenge-085/mark-anderson/raku/ch-2.p6
@@ -17,7 +17,7 @@ multi MAIN {
                 2**33    => 1;
 
     for @pairs -> $pair {
-        ok uint-log($pair.key) == $pair.value, ($pair).fmt("%10d --> %d")
+        ok uint-log($pair.key) == $pair.value, $pair.fmt("%10d --> %d")
     }
 }
     
-- 
cgit 


From b104d292b5090cca2b59e3acdb51136938e2658f Mon Sep 17 00:00:00 2001
From: chirvasitua <stuart-little@users.noreply.github.com>
Date: Mon, 2 Nov 2020 01:06:08 -0500
Subject: initial commit challenge 085

---
 challenge-085/stuart-little/raku/ch-1.p6 | 10 ++++++++++
 challenge-085/stuart-little/raku/ch-2.p6 | 10 ++++++++++
 2 files changed, 20 insertions(+)
 create mode 100755 challenge-085/stuart-little/raku/ch-1.p6
 create mode 100755 challenge-085/stuart-little/raku/ch-2.p6

diff --git a/challenge-085/stuart-little/raku/ch-1.p6 b/challenge-085/stuart-little/raku/ch-1.p6
new file mode 100755
index 0000000000..0d65361d8e
--- /dev/null
+++ b/challenge-085/stuart-little/raku/ch-1.p6
@@ -0,0 +1,10 @@
+#!/usr/bin/env perl6
+use v6;
+
+sub tripl(@a) {
+    @a.combinations(3).grep(1 < *.sum < 2).[0];
+}
+
+say (my $res=tripl(@*ARGS.map(*.Real))) ?? ("1: $res") !! 0;
+
+# run as <script> <space-separated numbers>
diff --git a/challenge-085/stuart-little/raku/ch-2.p6 b/challenge-085/stuart-little/raku/ch-2.p6
new file mode 100755
index 0000000000..a54c41193a
--- /dev/null
+++ b/challenge-085/stuart-little/raku/ch-2.p6
@@ -0,0 +1,10 @@
+#!/usr/bin/env perl6
+use v6;
+
+sub pw($n) {
+    ((1..^$n) X (2..^$n)).grep({ ($_[0] ** $_[1]) == $n }).map({ qq{$_[0]^$_[1]=$n} }).[0]
+}
+
+say (my $res=pw(@*ARGS[0].Int)) ?? ("1: $res") !! (0);
+
+# run as <script> <number>
-- 
cgit 


From 7507618f2682f8cc46c1cda1c72b6c9f98a07eb9 Mon Sep 17 00:00:00 2001
From: chirvasitua <stuart-little@users.noreply.github.com>
Date: Mon, 2 Nov 2020 01:18:23 -0500
Subject: initial commit challenges 074-078

---
 challenge-074/stuart-little/README       |  1 +
 challenge-074/stuart-little/raku/ch-1.p6 | 10 ++++++++
 challenge-074/stuart-little/raku/ch-2.p6 | 10 ++++++++
 challenge-075/stuart-little/README       |  1 +
 challenge-075/stuart-little/raku/ch-1.p6 | 11 +++++++++
 challenge-075/stuart-little/raku/ch-2.p6 | 25 +++++++++++++++++++
 challenge-076/stuart-little/README       |  1 +
 challenge-076/stuart-little/raku/ch-1.p6 | 16 ++++++++++++
 challenge-076/stuart-little/raku/ch-2.p6 | 42 ++++++++++++++++++++++++++++++++
 challenge-077/stuart-little/README       |  1 +
 challenge-077/stuart-little/raku/ch-1.p6 | 12 +++++++++
 challenge-077/stuart-little/raku/ch-2.p6 | 20 +++++++++++++++
 challenge-078/stuart-little/README       |  1 +
 challenge-078/stuart-little/raku/ch-1.p6 |  8 ++++++
 challenge-078/stuart-little/raku/ch-2.p6 | 15 ++++++++++++
 15 files changed, 174 insertions(+)
 create mode 100644 challenge-074/stuart-little/README
 create mode 100755 challenge-074/stuart-little/raku/ch-1.p6
 create mode 100755 challenge-074/stuart-little/raku/ch-2.p6
 create mode 100644 challenge-075/stuart-little/README
 create mode 100755 challenge-075/stuart-little/raku/ch-1.p6
 create mode 100755 challenge-075/stuart-little/raku/ch-2.p6
 create mode 100644 challenge-076/stuart-little/README
 create mode 100755 challenge-076/stuart-little/raku/ch-1.p6
 create mode 100755 challenge-076/stuart-little/raku/ch-2.p6
 create mode 100644 challenge-077/stuart-little/README
 create mode 100755 challenge-077/stuart-little/raku/ch-1.p6
 create mode 100755 challenge-077/stuart-little/raku/ch-2.p6
 create mode 100644 challenge-078/stuart-little/README
 create mode 100755 challenge-078/stuart-little/raku/ch-1.p6
 create mode 100755 challenge-078/stuart-little/raku/ch-2.p6

diff --git a/challenge-074/stuart-little/README b/challenge-074/stuart-little/README
new file mode 100644
index 0000000000..76119cbbb8
--- /dev/null
+++ b/challenge-074/stuart-little/README
@@ -0,0 +1 @@
+Solutions by Stuart Little.
diff --git a/challenge-074/stuart-little/raku/ch-1.p6 b/challenge-074/stuart-little/raku/ch-1.p6
new file mode 100755
index 0000000000..b6c196b5f4
--- /dev/null
+++ b/challenge-074/stuart-little/raku/ch-1.p6
@@ -0,0 +1,10 @@
+#!/usr/bin/env perl6
+use v6;
+
+sub maj(@a) {
+    @a.grep({ @a.grep($_).elems > floor(@a/2) }).[0] || -1
+}
+
+say maj(@*ARGS);
+
+# run as <script> <space-separated integers>
diff --git a/challenge-074/stuart-little/raku/ch-2.p6 b/challenge-074/stuart-little/raku/ch-2.p6
new file mode 100755
index 0000000000..d2fa5618a5
--- /dev/null
+++ b/challenge-074/stuart-little/raku/ch-2.p6
@@ -0,0 +1,10 @@
+#!/usr/bin/env perl6
+use v6;
+
+sub fnr(Str $s) {
+    $s.split('',:skip-empty).grep({ $s.indices($_) == 1 }).[0] || '#'
+}
+
+say (1..@*ARGS[0].chars).map({@*ARGS[0].substr(0,$_)}).map(&fnr);
+
+# run as <script> <space-separated integers>
diff --git a/challenge-075/stuart-little/README b/challenge-075/stuart-little/README
new file mode 100644
index 0000000000..76119cbbb8
--- /dev/null
+++ b/challenge-075/stuart-little/README
@@ -0,0 +1 @@
+Solutions by Stuart Little.
diff --git a/challenge-075/stuart-little/raku/ch-1.p6 b/challenge-075/stuart-little/raku/ch-1.p6
new file mode 100755
index 0000000000..c91de3e4b3
--- /dev/null
+++ b/challenge-075/stuart-little/raku/ch-1.p6
@@ -0,0 +1,11 @@
+#!/usr/bin/env perl6
+use v6;
+
+sub coins($s, @c) {
+    (! @c.grep(* <= $s)) && return ((),);
+    return (|coins($s-@c[0], @c).map({ @c[0], |$_ }), |coins($s, @c[1..*])).grep(*.sum == $s);
+}
+
+for coins(@*ARGS[0].Int, @*ARGS[1..*].map(*.Int).sort) { .say};
+
+# run as <script> <sum> <space-separated coin values>
diff --git a/challenge-075/stuart-little/raku/ch-2.p6 b/challenge-075/stuart-little/raku/ch-2.p6
new file mode 100755
index 0000000000..2dbd952ae3
--- /dev/null
+++ b/challenge-075/stuart-little/raku/ch-2.p6
@@ -0,0 +1,25 @@
+#!/usr/bin/env perl6
+use v6;
+
+sub rect(@a) {
+    @a
+    .keys
+    .combinations(2)
+    .map({ @a[$_.[0]..$_.[1]].min*($_.[1]-$_.[0]+1) })
+    .max
+}
+
+sub hist(@a) {
+    (1..@a.max)
+    .map( -> $val { @a.keys.map({
+($val <= @a.[$_]) ?? ('#') !! (' ') })
+		  })
+    .reverse
+    .join("\n")
+}
+
+say hist(@*ARGS.map(*.Int)),
+"\n" ~ ('- ' x @*ARGS) ~ "\n",
+max(rect(@*ARGS.map(*.Int)), @*ARGS.map(*.Int).max);
+
+# run as <script> <space-separated numbers>
diff --git a/challenge-076/stuart-little/README b/challenge-076/stuart-little/README
new file mode 100644
index 0000000000..76119cbbb8
--- /dev/null
+++ b/challenge-076/stuart-little/README
@@ -0,0 +1 @@
+Solutions by Stuart Little.
diff --git a/challenge-076/stuart-little/raku/ch-1.p6 b/challenge-076/stuart-little/raku/ch-1.p6
new file mode 100755
index 0000000000..3e3d358c54
--- /dev/null
+++ b/challenge-076/stuart-little/raku/ch-1.p6
@@ -0,0 +1,16 @@
+#!/usr/bin/env perl6
+use v6;
+
+sub minpr(Int $n where * >= 2) {
+    ($n.is-prime) && return 1;
+    return 1+(2 ...^ *>$n)
+    .grep(*.is-prime)
+    .map({ $n-$_ })
+    .grep(* >= 2)
+    .map(&minpr)
+    .min;
+}
+
+say minpr(@*ARGS.[0].Int);
+
+# run as <script> <number>
diff --git a/challenge-076/stuart-little/raku/ch-2.p6 b/challenge-076/stuart-little/raku/ch-2.p6
new file mode 100755
index 0000000000..ff4c177067
--- /dev/null
+++ b/challenge-076/stuart-little/raku/ch-2.p6
@@ -0,0 +1,42 @@
+#!/usr/bin/env perl6
+use v6;
+
+my ($word_file, $grid_file) = @*ARGS[0,1];
+
+my @words=$word_file.IO.lines;
+my $grid = (($grid_file) ?? ($grid_file.IO.slurp) !! ($=finish))
+.lc.split(/\n+/).grep(* ~~ /\S+/).map(*.split(/\s+/)).map(*.List);
+
+my @range=(-($grid+$grid[0])..^$grid+$grid[0]);
+my ($ver, $se, $ne) = ((1,0),(1,1),(1,-1))
+.map( -> $coord { @range.map( -> $x { @range.map({ $grid[$coord.[0]*$_][$x+$coord.[1]*$_] }).grep(*.defined) }).grep(*.elems).map(*.List) })
+.map(*.List)
+.map({ $_.map(*.join) });
+
+my @grid_strings_to_match=(|$grid.map(*.join), |$ver, |$se, |$ne);
+
+for @words.grep(*.chars >= 5).grep( -> $word { @grid_strings_to_match.grep({ $_.contains($word) || $_.contains($word.flip) }) }) { .say};
+
+=finish
+B I D E M I A T S U C C O R S T
+L D E G G I W Q H O D E E H D P
+U S E I R U B U T E A S L A G U
+N G N I Z I L A I C O S C N U D
+T G M I D S T S A R A R E I F G
+S R E N M D C H A S I V E E L I
+S C S H A E U E B R O A D M T E
+H W O V L P E D D L A I U L S S
+R Y O N L A S F C S T A O G O T
+I G U S S R R U G O V A R Y O C
+N R G P A T N A N G I L A M O O
+E I H A C E I V I R U S E S E D
+S E T S U D T T G A R L I C N H
+H V R M X L W I U M S N S O T B
+A E A O F I L C H T O D C A E U
+Z S C D F E C A A I I R L N R F
+A R I I A N Y U T O O O U T P F
+R S E C I S N A B O S C N E R A
+D R S M P C U U N E L T E S I L
+
+# run as <script> <path-to-word-file> <path-to-grid-file> 
+# the example grid is included for convenience as a fallback if you want to run it without the grid-file argument (i.e. with only the word-file argument)
diff --git a/challenge-077/stuart-little/README b/challenge-077/stuart-little/README
new file mode 100644
index 0000000000..76119cbbb8
--- /dev/null
+++ b/challenge-077/stuart-little/README
@@ -0,0 +1 @@
+Solutions by Stuart Little.
diff --git a/challenge-077/stuart-little/raku/ch-1.p6 b/challenge-077/stuart-little/raku/ch-1.p6
new file mode 100755
index 0000000000..cab30285d6
--- /dev/null
+++ b/challenge-077/stuart-little/raku/ch-1.p6
@@ -0,0 +1,12 @@
+#!/usr/bin/env perl6
+use v6;
+
+sub fibsum($n) {
+    (1,2,* + * ... * >= $n)
+    .combinations
+    .grep(*.sum == $n)
+}
+
+for (fibsum(@*ARGS.[0].Int)) { .say }
+
+# run as <script> <number>
diff --git a/challenge-077/stuart-little/raku/ch-2.p6 b/challenge-077/stuart-little/raku/ch-2.p6
new file mode 100755
index 0000000000..5984f94769
--- /dev/null
+++ b/challenge-077/stuart-little/raku/ch-2.p6
@@ -0,0 +1,20 @@
+#!/usr/bin/env perl6
+use v6;
+
+sub lnly(@a) {
+    ((^@a.elems) X (^@a[0].elems))
+    .grep({ @a[$_[0]][$_[1]] && (@a[$_[0]][$_[1]] eq 'x') })
+    .map({ (($_.[0] X+ (0,-1,1)).grep(*>=0) X ($_.[1] X+ (0,-1,1)).grep(*>=0)).[1..*]  })
+    .map({ $_.grep({ @a[$_[0]][$_[1]] }).map({ @a[$_[0]][$_[1]] }) })
+    .map(*.join).grep(* !~~ /x/)
+    .elems
+}
+
+say lnly(@*ARGS.map(*.split('', :skip-empty)));
+
+# run as <script> <space-separated strings representing the rows of the matrix>
+# <script> x0x 00x 00x inputs the matrix
+# x0x
+# 00x
+# 00x
+# 
diff --git a/challenge-078/stuart-little/README b/challenge-078/stuart-little/README
new file mode 100644
index 0000000000..76119cbbb8
--- /dev/null
+++ b/challenge-078/stuart-little/README
@@ -0,0 +1 @@
+Solutions by Stuart Little.
diff --git a/challenge-078/stuart-little/raku/ch-1.p6 b/challenge-078/stuart-little/raku/ch-1.p6
new file mode 100755
index 0000000000..7199ecf091
--- /dev/null
+++ b/challenge-078/stuart-little/raku/ch-1.p6
@@ -0,0 +1,8 @@
+#!/usr/bin/env perl6
+use v6;
+
+sub ldr(@a) {
+    @a.[@a.keys.grep({ @a.[$_] == @a.[$_..*].max })]
+}
+
+say ldr(@*ARGS.map(*.Int));
diff --git a/challenge-078/stuart-little/raku/ch-2.p6 b/challenge-078/stuart-little/raku/ch-2.p6
new file mode 100755
index 0000000000..28f5e1adff
--- /dev/null
+++ b/challenge-078/stuart-little/raku/ch-2.p6
@@ -0,0 +1,15 @@
+#!/usr/bin/env perl6
+use v6;
+
+sub rot(@a,@b) {
+    @b.map({ |@a.[$_..*], |@a.[^$_] })
+}
+
+my @a=@*ARGS[^(@*ARGS.first('-',:k))];
+my @b=@*ARGS[(@*ARGS.first('-',:k))^..*];
+
+for (rot(@a,@b)) {
+    .say;
+}
+
+# run as <script> <entries of the two arrays, separated by a '-'> with all individual entries space-separated
-- 
cgit 


From 531ddb021e0c3718813f68208a54d27bf7c9b15f Mon Sep 17 00:00:00 2001
From: drbaggy <js5@sanger.ac.uk>
Date: Mon, 2 Nov 2020 07:19:15 +0000
Subject: naive first pass solutions

---
 challenge-085/james-smith/perl/ch-1.pl | 22 ++++++++++++++++++++++
 challenge-085/james-smith/perl/ch-2.pl | 23 +++++++++++++++++++++++
 2 files changed, 45 insertions(+)
 create mode 100644 challenge-085/james-smith/perl/ch-1.pl
 create mode 100644 challenge-085/james-smith/perl/ch-2.pl

diff --git a/challenge-085/james-smith/perl/ch-1.pl b/challenge-085/james-smith/perl/ch-1.pl
new file mode 100644
index 0000000000..025b30c9e1
--- /dev/null
+++ b/challenge-085/james-smith/perl/ch-1.pl
@@ -0,0 +1,22 @@
+#!/usr/local/bin/perl
+
+use strict;
+use warnings;
+use Test::More;
+
+is( trip_sum(qw(1.2 0.4 0.1 2.5)), 1 );
+is( trip_sum(qw(0.2 1.5 0.9 1.1)), 0 );
+is( trip_sum(qw(0.5 1.1 0.3 0.7)), 1 );
+
+done_testing;
+
+sub trip_sum {
+  for my $i (0.. (@_-3) ) {
+    for my $j ( ($i+1).. (@_-2) ) {
+      for ( ($j+1) .. (@_-1) ) {
+        return 1 if 1 < $_[$i]+$_[$j]+$_[$_] && $_[$i]+$_[$j]+$_[$_] < 2;
+      }
+    }
+  }
+  return 0;
+}
diff --git a/challenge-085/james-smith/perl/ch-2.pl b/challenge-085/james-smith/perl/ch-2.pl
new file mode 100644
index 0000000000..782f4ec5b1
--- /dev/null
+++ b/challenge-085/james-smith/perl/ch-2.pl
@@ -0,0 +1,23 @@
+#!/usr/local/bin/perl
+
+use strict;
+use warnings;
+use Test::More;
+
+is( is_power(8),   1);
+is( is_power(15),  0);
+is( is_power(125), 1);
+
+done_testing;
+
+sub is_power {
+  my $n = shift;
+  for(my $i=2;1;$i++) {
+    last if 2**$i>$n;
+    for($_=1;1;$_++) {
+      return 1 if $n == $_**$i;
+      last if $_**$i>$n;
+    }
+  }
+  return 0;
+}
-- 
cgit 


From 3cb26cb56ed1a6981e06ba31b35f8e566ca422d4 Mon Sep 17 00:00:00 2001
From: E7-87-83 <fungcheokyin@gmail.com>
Date: Mon, 2 Nov 2020 15:51:43 +0800
Subject: So sad, have forgetten to upload for #084; be an early bird for #085

---
 challenge-084/cheok-yin-fung/perl/ch-1.pl | 72 ++++++++++++++++++++++++++++
 challenge-084/cheok-yin-fung/perl/ch-2.pl | 80 +++++++++++++++++++++++++++++++
 challenge-085/cheok-yin-fung/perl/ch-1.pl | 62 ++++++++++++++++++++++++
 3 files changed, 214 insertions(+)
 create mode 100644 challenge-084/cheok-yin-fung/perl/ch-1.pl
 create mode 100644 challenge-084/cheok-yin-fung/perl/ch-2.pl
 create mode 100644 challenge-085/cheok-yin-fung/perl/ch-1.pl

diff --git a/challenge-084/cheok-yin-fung/perl/ch-1.pl b/challenge-084/cheok-yin-fung/perl/ch-1.pl
new file mode 100644
index 0000000000..0abed1ccf2
--- /dev/null
+++ b/challenge-084/cheok-yin-fung/perl/ch-1.pl
@@ -0,0 +1,72 @@
+#!/usr/bin/perl
+# The Weekly challenge - Perl & Raku Week 084
+# Task 1 Reverse Integer
+# 
+# Description: The number 2,147,483,647 is the 
+# maximum positive value for a 32-bit signed binary integer in computing.
+#
+# additional info from books:
+# minimum value for a 32-bigt signed binary integer: -2147483648
+
+use strict;
+use warnings;
+#use Test::More tests => 4;
+
+# 8463847412
+# 2147483648
+# 9876543210 
+
+my @r_MAXPOS = split "", "2147483647";
+my @r_MAXNEG_WO_SIGN = split "", "2147483648";
+
+if ($ARGV[0] ne "") {
+    print(ri($ARGV[0]), "\n");
+} 
+else {
+    print -1_000_000, "\n";
+    print(ri(-1_000_000) ,"\n") ; #should it be -000_000_1 or -1 ?
+}
+
+sub compare_digits {
+    my @indvar = @{$_[0]};
+    my @bigbro = @{$_[1]};
+    return 0 if scalar @indvar > 10;
+    return 1 if scalar @indvar < 10;
+    for (0..9) {
+        return 0 if $indvar[$_] > $bigbro[$_];
+    }
+    return 1;
+}
+
+
+sub ri {
+    my @arr = split "" , $_[0];
+    my $sgn = "+";
+    $sgn = shift @arr if $arr[0] eq '-' ;
+    my @r_arr = reverse @arr;
+    if ($sgn eq '+') {
+        if (compare_digits([@r_arr], [@r_MAXPOS])) {
+            return join "",  @r_arr;
+        }
+        else {
+            return 0;
+        }
+    } 
+    else {
+        if (compare_digits([@r_arr], [@r_MAXNEG_WO_SIGN])) {
+            return '-'.(join "", @r_arr);
+        }
+        else {
+            return 0;
+        }
+    }
+    
+}
+
+=pod
+ok ri(1234) == 4321, "example 1";
+ok ri(-1234) == -4321, "example 2";
+ok ri(1231230512) == 0, "example 3";
+ok ri(7_463_847_412) == 2_147_483_647, "max 32-bit integer";
+=cut
+
diff --git a/challenge-084/cheok-yin-fung/perl/ch-2.pl b/challenge-084/cheok-yin-fung/perl/ch-2.pl
new file mode 100644
index 0000000000..c3b70696d6
--- /dev/null
+++ b/challenge-084/cheok-yin-fung/perl/ch-2.pl
@@ -0,0 +1,80 @@
+#!/usr/bin/perl
+use strict;
+use warnings;
+#use Test::More tests => 4;
+#use Data::Dumper;
+
+if ($ARGV[0]) {
+    my @f = @ARGV;
+    my $M = shift @f;
+    my $N = shift @f;
+    my @matrix = ();
+    die "Input Parameters Error" unless scalar @f == $M*$N;
+    for my $counter (0..$M-1) {
+        push @matrix , [ @f[$N*$counter..$N*$counter+$N-1] ]; 
+    }
+
+#    print Dumper(@matrix);
+    print_matrix([@matrix]);
+    print 'ans: ', find_sq([@matrix]), "\n"; 
+} 
+else {
+    for(1..3) {
+        print "[1,1,1,1]";
+        print "\n";
+    }
+     print 'ans: ', find_sq([[1,1,1,1],[1,1,1,1],[1,1,1,1]]), "\n";  
+     #all 1s, should be 8
+}
+
+
+sub print_matrix {
+    my @mat = @{$_[0]};  
+    my $M = scalar @mat;
+    my $N = scalar @{$mat[0]};
+    for my $i (0..$M-1) {
+        print "[", join(", ", @{$mat[$i]}), "]" ;
+        print "\n";
+    }
+}
+
+sub find_sq {
+    my @mat = @{$_[0]};  
+    my $nsq = 0;
+    my $M = scalar @mat;
+    my $N = scalar @{$mat[0]};
+    
+    for my $i (0..$M-2) {
+        for my $j (0..$N-2) {
+            my $max_len_sq = $M-$i < $N-$j ? $M-$i : $N-$j;  #sign of the ineq
+            for my $k (2..$max_len_sq) {
+                $nsq++ if bool_contain_sq([@mat], $i, $j, $k);
+            }     
+        }
+    }
+
+    return $nsq;
+
+}
+
+sub bool_contain_sq {
+    my @mat = @{$_[0]};
+    my $r = $_[1];
+    my $c = $_[2];
+    my $len_side = $_[3];
+
+    return (${$mat[$r]}[$c] && ${$mat[$r+$len_side-1]}[$c] &&
+         ${$mat[$r]}[$c+$len_side-1] && ${$mat[$r+$len_side-1]}[$c+$len_side-1] );
+}
+
+
+=pod
+ok(find_sq([[ 0,1,0,1 ], [ 0, 0, 1,0 ], [ 1, 1 ,0 ,1],[1, 0, 0, 1 ]] )== 1,
+    "Example 1");
+ok(find_sq([[ 1 ,1, 0, 1 ], [ 1, 1 ,0 ,0 ],  [ 0, 1, 1 ,1 ],  [ 1, 0, 1, 1 ]] 
+    )== 4,  "Example 2");
+ok(find_sq([[ 0 ,1 ,0 ,1 ], [ 1, 0 ,1 ,0 ], [ 0 ,1 ,0 ,0 ], [ 1, 0 ,0 ,1 ]]
+    ) == 0,  "Example 3");
+ok(find_sq([[1,1,1,1],[1,1,1,1],[1,1,1,1],[1,1,1,1]]
+    ) == 14, "a 4x4 matrix with every entry being 1");
+=cut
diff --git a/challenge-085/cheok-yin-fung/perl/ch-1.pl b/challenge-085/cheok-yin-fung/perl/ch-1.pl
new file mode 100644
index 0000000000..e049094198
--- /dev/null
+++ b/challenge-085/cheok-yin-fung/perl/ch-1.pl
@@ -0,0 +1,62 @@
+#!/usr/bin/perl
+# The Weekly Challenge 085 - Task 1 Triplet Sum
+# Usage: ch-1.pl (array of numbers)
+# Example: ch-1.pl 0.44 0.6 1
+use strict;
+use warnings;
+#use Test::More tests => 4;
+
+sub diff {
+    my ($a, $b, $c) = @_;
+    return 0 if $a == $b || $b == $c || $c == $a;
+    return 1;
+}
+
+sub trisum {
+    my @R = @{$_[0]};
+    @R = sort @R;
+    my $L = scalar @R;
+    my %h;
+    for my $i (0..$L-1) {
+        for my $j (0..$L-2) {
+            for my $k (0..$L-3) {
+                my ($i, $j, $k) = sort ($i, $j, $k);
+                if ( diff($i,$j,$k) and !($h{"$i,$j,$k"}) ) {
+                  $h{"$i,$j,$k"} = 1;
+                  my $s = $R[$i]+$R[$j]+$R[$k];
+                  if ($s > 1 and $s < 2) {
+                    print ("  ", (join " + ", ($R[$i],$R[$j],$R[$k]) ),"\n");
+                    print ("= ", $s, "\n" x 2);
+                    return 1;
+                  }
+                }
+            }
+        }
+    }
+    return 0;
+}
+
+if ($ARGV[0]) {
+    die "not enough parameters" if scalar @ARGV < 3;
+    for my $term (@ARGV) {
+        if (($term !~ /^(\+)?[0-9]+(\.)[0-9]+$/) 
+                and ($term !~ /^(\+)?[1-9]+$/)) { 
+            die "\"$term\" is not numeric"             #exception handling 
+    }}
+    print trisum([@ARGV]);
+    print "\n";
+} 
+else {
+    my @arry = (0.4, 0.4, 0.5, 0.6);
+    print "array of positive real numbers: ", join " ", @arry;
+    print "\n" x 2;
+    print trisum([@arry]);
+    print "\n";
+}
+
+=pod
+ok(trisum([1.2,0.4,0.1,2.5]), "Example 1");
+ok(trisum([0.2,1.5,0.9,1.1]) == 0, "Example 2");
+ok(trisum([0.5,1.1,0.3,0.7]), "Example 3");
+ok(trisum([0.33, 0.33, 0.33, 0.44]), "My Test Case 1");
+=cut
-- 
cgit 


From 2051afec70fb68dd114c66e09edc620a16016266 Mon Sep 17 00:00:00 2001
From: 冯昶 <seaker@qq.com>
Date: Mon, 2 Nov 2020 16:04:15 +0800
Subject: challenge #085, raku solutions

---
 challenge-085/feng-chang/raku/ch-1.raku |  5 +++++
 challenge-085/feng-chang/raku/ch-2.raku | 18 ++++++++++++++++++
 2 files changed, 23 insertions(+)
 create mode 100755 challenge-085/feng-chang/raku/ch-1.raku
 create mode 100755 challenge-085/feng-chang/raku/ch-2.raku

diff --git a/challenge-085/feng-chang/raku/ch-1.raku b/challenge-085/feng-chang/raku/ch-1.raku
new file mode 100755
index 0000000000..353b534dd5
--- /dev/null
+++ b/challenge-085/feng-chang/raku/ch-1.raku
@@ -0,0 +1,5 @@
+#!/bin/env raku
+
+sub MAIN(*@R where *.elems ≥ 3) {
+    say +(@R.combinations(3)».sum.grep({ 1 < $_ < 2 }).elems > 0);
+}
diff --git a/challenge-085/feng-chang/raku/ch-2.raku b/challenge-085/feng-chang/raku/ch-2.raku
new file mode 100755
index 0000000000..5b03c72264
--- /dev/null
+++ b/challenge-085/feng-chang/raku/ch-2.raku
@@ -0,0 +1,18 @@
+#!/bin/env raku
+
+multi sub MAIN(1) {
+    say 1;
+}
+
+multi sub MAIN($N where * > 1) {
+    for 2..^$N -> $b {
+        for 2,3 ...^ * ** $b > $N -> $a {
+            if $a**$b == $N {
+                say 1;
+                exit;
+            }
+        }
+    }
+
+    say 0;
+}
-- 
cgit 


From 9fd87b20eba89ba32d2cd02d7747ef8f1600ceac Mon Sep 17 00:00:00 2001
From: drbaggy <js5@sanger.ac.uk>
Date: Mon, 2 Nov 2020 09:18:20 +0000
Subject: more testing and some optimization

---
 challenge-085/james-smith/perl/ch-1.pl |  2 ++
 challenge-085/james-smith/perl/ch-2.pl | 23 ++++++++++++++++-------
 2 files changed, 18 insertions(+), 7 deletions(-)

diff --git a/challenge-085/james-smith/perl/ch-1.pl b/challenge-085/james-smith/perl/ch-1.pl
index 025b30c9e1..352ddbfcdd 100644
--- a/challenge-085/james-smith/perl/ch-1.pl
+++ b/challenge-085/james-smith/perl/ch-1.pl
@@ -12,7 +12,9 @@ done_testing;
 
 sub trip_sum {
   for my $i (0.. (@_-3) ) {
+    next unless $_[$i] < 2;          ## For large arrays this might save some time...;
     for my $j ( ($i+1).. (@_-2) ) {
+      next unless $_[$i]+$_[$j] < 2; ## For large arrays this might save some time...;
       for ( ($j+1) .. (@_-1) ) {
         return 1 if 1 < $_[$i]+$_[$j]+$_[$_] && $_[$i]+$_[$j]+$_[$_] < 2;
       }
diff --git a/challenge-085/james-smith/perl/ch-2.pl b/challenge-085/james-smith/perl/ch-2.pl
index 782f4ec5b1..be15852334 100644
--- a/challenge-085/james-smith/perl/ch-2.pl
+++ b/challenge-085/james-smith/perl/ch-2.pl
@@ -4,19 +4,28 @@ use strict;
 use warnings;
 use Test::More;
 
-is( is_power(8),   1);
-is( is_power(15),  0);
-is( is_power(125), 1);
+is( is_power(1),        1);
+is( is_power(8),        1);
+is( is_power(15),       0);
+is( is_power(125),      1);
+is( is_power(21943**3), 1);
+is( is_power(4294967295),    0);
+is( is_power(2**60),    1);
+is( is_power(225),      1);
 
 done_testing;
 
 sub is_power {
+  ## Avoid using powers as this is inefficient...
   my $n = shift;
+  return 1 if $n == 1;    ## This is an edge case!
   for(my $i=2;1;$i++) {
-    last if 2**$i>$n;
-    for($_=1;1;$_++) {
-      return 1 if $n == $_**$i;
-      last if $_**$i>$n;
+    my $s = $i*$i;
+    last if $s>$n;
+    for($_=0;1;$_++) {
+      return 1 if $s == $n;
+      last if $n%$s;
+      $s*=$i;
     }
   }
   return 0;
-- 
cgit 


From e1d629342006576423cc5299c2c80bc15fbae7e2 Mon Sep 17 00:00:00 2001
From: Simon Proctor <simon.proctor@zoopla.co.uk>
Date: Mon, 2 Nov 2020 09:24:34 +0000
Subject: Challenge 85

---
 challenge-085/simon-proctor/raku/ch-1.raku | 12 ++++++++++++
 challenge-085/simon-proctor/raku/ch-2.raku | 21 +++++++++++++++++++++
 2 files changed, 33 insertions(+)
 create mode 100644 challenge-085/simon-proctor/raku/ch-1.raku
 create mode 100644 challenge-085/simon-proctor/raku/ch-2.raku

diff --git a/challenge-085/simon-proctor/raku/ch-1.raku b/challenge-085/simon-proctor/raku/ch-1.raku
new file mode 100644
index 0000000000..0b3986cd6c
--- /dev/null
+++ b/challenge-085/simon-proctor/raku/ch-1.raku
@@ -0,0 +1,12 @@
+#!/usr/bin/env raku
+
+use v6;
+
+subset URat of Rat where * > 0;
+
+# Given a list of positive numbers return 1 if 3 of them add up to a value between 1 and 2. Otherwise return 0. 
+sub MAIN (
+    *@R where { URat ~~ $_.all } #= List of positive numbers
+) {
+    (so (1 < any(@R.combinations(3).map( -> @c { [+] @c } ) ) < 2)).Int.say;
+}
diff --git a/challenge-085/simon-proctor/raku/ch-2.raku b/challenge-085/simon-proctor/raku/ch-2.raku
new file mode 100644
index 0000000000..982d8efb5a
--- /dev/null
+++ b/challenge-085/simon-proctor/raku/ch-2.raku
@@ -0,0 +1,21 @@
+#!/usr/bin/env raku
+
+use v6;
+
+#| Given a number return 1 if it can be expressed as a integer power of an integer
+sub MAIN ( UInt $N ) {
+    # Technically works but it's overkill
+    #(so any((0..$N) X** (2..$N)) == $N).Int.say;
+    
+    A: for 0..$N -> $a {
+        for 2..$N -> $b {
+            if $a ** $b == $N {
+                say 1;
+                exit;
+            }
+            next A if $a ** $b > $N;
+        }
+    }
+
+    say 0;
+}
-- 
cgit 


From b5fb5e443f2f2596ef361678d09d2f5412db001a Mon Sep 17 00:00:00 2001
From: Simon Proctor <simon.proctor@zoopla.co.uk>
Date: Mon, 2 Nov 2020 09:27:45 +0000
Subject: I am an idiot

---
 challenge-085/simon-proctor/raku/ch-2.raku | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/challenge-085/simon-proctor/raku/ch-2.raku b/challenge-085/simon-proctor/raku/ch-2.raku
index 982d8efb5a..a2b2cc4709 100644
--- a/challenge-085/simon-proctor/raku/ch-2.raku
+++ b/challenge-085/simon-proctor/raku/ch-2.raku
@@ -5,9 +5,9 @@ use v6;
 #| Given a number return 1 if it can be expressed as a integer power of an integer
 sub MAIN ( UInt $N ) {
     # Technically works but it's overkill
-    #(so any((0..$N) X** (2..$N)) == $N).Int.say;
+    #(so any((1..$N) X** (2..$N)) == $N).Int.say;
     
-    A: for 0..$N -> $a {
+    A: for 1..$N -> $a {
         for 2..$N -> $b {
             if $a ** $b == $N {
                 say 1;
-- 
cgit 


From d3619418eb4d5184cf4a4e29162c6d0535a3fe8f Mon Sep 17 00:00:00 2001
From: Myoungjin JEON <jeongoon@gmail.com>
Date: Mon, 2 Nov 2020 21:42:49 +1100
Subject: [ch-085/jeongoon] Blogs about Raku soludtion added

---
 challenge-085/jeongoon/blog.txt  | 1 +
 challenge-085/jeongoon/blog1.txt | 1 +
 2 files changed, 2 insertions(+)
 create mode 100644 challenge-085/jeongoon/blog.txt
 create mode 100644 challenge-085/jeongoon/blog1.txt

diff --git a/challenge-085/jeongoon/blog.txt b/challenge-085/jeongoon/blog.txt
new file mode 100644
index 0000000000..60cddc7328
--- /dev/null
+++ b/challenge-085/jeongoon/blog.txt
@@ -0,0 +1 @@
+https://dev.to/jeongoon/weekly-challenge-085-task-1-raku-4de3
diff --git a/challenge-085/jeongoon/blog1.txt b/challenge-085/jeongoon/blog1.txt
new file mode 100644
index 0000000000..99d4fc0ea8
--- /dev/null
+++ b/challenge-085/jeongoon/blog1.txt
@@ -0,0 +1 @@
+https://dev.to/jeongoon/weekly-challenge-085-task-2-raku-35ob
-- 
cgit 


From 45c48ef959298df6e2380eb0414f5c7ce11eea53 Mon Sep 17 00:00:00 2001
From: Kai Burgdorf <k@iburgdorf.de>
Date: Mon, 2 Nov 2020 12:51:32 +0100
Subject: fix: now check wether result fits in int

---
 challenge-084/kai-burgdorf/perl/ch-1.pl | 15 +++++++++------
 1 file changed, 9 insertions(+), 6 deletions(-)

diff --git a/challenge-084/kai-burgdorf/perl/ch-1.pl b/challenge-084/kai-burgdorf/perl/ch-1.pl
index 0e890b6e44..7e514f1886 100755
--- a/challenge-084/kai-burgdorf/perl/ch-1.pl
+++ b/challenge-084/kai-burgdorf/perl/ch-1.pl
@@ -6,13 +6,16 @@ use warnings;
 use Data::Dumper;
 
 my $N = $ARGV[0] // 1234;
+my $output;
+my @numbers = split( "", $N );
 
-if ($N >= 2147483647) {
-  print "0";
+while ( scalar @numbers != 0 ) {
+    $output .= pop @numbers;
+}
+if ( $output >= 2147483647 ) {
+    print "0\n";
 }
 else {
-  my @numbers = split("", $N);
-  while(scalar @numbers != 0) {
-    print pop @numbers;
-  }
+    print $output . "\n";
 }
+
-- 
cgit 


From 9414aee35a3f6411ccaa086d57d871e2862fdd39 Mon Sep 17 00:00:00 2001
From: Kai Burgdorf <k@iburgdorf.de>
Date: Mon, 2 Nov 2020 12:52:26 +0100
Subject: fixed reverse integer challenge for negative numbers

---
 challenge-084/kai-burgdorf/perl/ch-1.pl | 10 +++++++++-
 1 file changed, 9 insertions(+), 1 deletion(-)

diff --git a/challenge-084/kai-burgdorf/perl/ch-1.pl b/challenge-084/kai-burgdorf/perl/ch-1.pl
index 7e514f1886..be502a44f2 100755
--- a/challenge-084/kai-burgdorf/perl/ch-1.pl
+++ b/challenge-084/kai-burgdorf/perl/ch-1.pl
@@ -9,10 +9,18 @@ my $N = $ARGV[0] // 1234;
 my $output;
 my @numbers = split( "", $N );
 
+my $sign = "";
+if ( $numbers[0] eq "-" ) {
+    $sign = shift @numbers;
+}
+
 while ( scalar @numbers != 0 ) {
     $output .= pop @numbers;
 }
-if ( $output >= 2147483647 ) {
+
+$output = $sign . $output;
+
+if ( $output > 2147483647 || $output < -2147483648 ) {
     print "0\n";
 }
 else {
-- 
cgit 


From b4228f0201905138570ec5a9459997757d44d266 Mon Sep 17 00:00:00 2001
From: Kai Burgdorf <k@iburgdorf.de>
Date: Mon, 2 Nov 2020 12:52:37 +0100
Subject: revise code

---
 challenge-084/kai-burgdorf/perl/ch-2.pl | 18 ++++++------------
 1 file changed, 6 insertions(+), 12 deletions(-)

diff --git a/challenge-084/kai-burgdorf/perl/ch-2.pl b/challenge-084/kai-burgdorf/perl/ch-2.pl
index 85de550fe3..15720b2f24 100755
--- a/challenge-084/kai-burgdorf/perl/ch-2.pl
+++ b/challenge-084/kai-burgdorf/perl/ch-2.pl
@@ -12,19 +12,14 @@ my @input = ( [ 0, 1, 0, 1 ], [ 0, 0, 1, 0 ], [ 1, 1, 0, 1 ], [ 1, 0, 0, 1 ] );
 #Example 3 - Output: 0
 #my @input = ( [ 0, 1, 0, 1 ], [ 1, 0, 1, 0 ], [ 0, 1, 0, 0 ], [ 1, 0, 0, 1 ] );
 
-my $size    = scalar @{ $input[0] };
 my $squares = 0;
 
-my $r = 0;
-for my $row (@input) {
-    my $c = 0;
-    for my $elem ( @{$row} ) {
-        if ( $elem == 1 ) {
-            $squares += get_squares( $r, $c );
+for my $row ( 0 ... $#input ) {
+    for my $col ( 0 .. $#{ $input[$row] } ) {
+        if ( $input[$row][$col] == 1 ) {
+            $squares += get_squares( $row, $col );
         }
-        $c++;
     }
-    $r++;
 }
 
 print "Output: $squares\n";
@@ -33,13 +28,12 @@ sub get_squares {
     my ( $r, $c ) = @_;
 
     my $square_count = 0;
-    my @row          = @{ $input[$r] };
 
-    for my $top_right ( $c + 1 .. $#row ) {
+    for my $top_right ( $c + 1 .. $#{ $input[$r] } ) {
 
         my $bottom_row = $r + $top_right - $c;
 
-        if (   $bottom_row < $size
+        if (   $bottom_row < scalar @input
             && $input[$r][$top_right] == 1
             && $input[$bottom_row][$c] == 1
             && $input[$bottom_row][$top_right] == 1 )
-- 
cgit 


From 0f3f21e833e54beb4a6da07d2972fb3867381d0f Mon Sep 17 00:00:00 2001
From: Mark Anderson <mark@frontrangerunner.com>
Date: Mon, 2 Nov 2020 05:14:10 -0700
Subject: Challenge 85 Solutions (Raku)

---
 challenge-085/mark-anderson/raku/ch-1.p6 | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/challenge-085/mark-anderson/raku/ch-1.p6 b/challenge-085/mark-anderson/raku/ch-1.p6
index 3ab0ac888f..fe36eac9c6 100644
--- a/challenge-085/mark-anderson/raku/ch-1.p6
+++ b/challenge-085/mark-anderson/raku/ch-1.p6
@@ -1,4 +1,4 @@
-multi MAIN(*@R where .all ~~ Real) {
+multi MAIN(*@R where { .all ~~ Real and .all > 0 }) {
     say triplet-sum(@R)
 }
  
-- 
cgit 


From 1598f50e40fcd50f0c20f360d422fbdfb877bf4e Mon Sep 17 00:00:00 2001
From: Mark Anderson <mark@frontrangerunner.com>
Date: Mon, 2 Nov 2020 05:25:16 -0700
Subject: Challenge 85 Solutions (Raku)

---
 challenge-085/mark-anderson/raku/ch-1.p6 | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/challenge-085/mark-anderson/raku/ch-1.p6 b/challenge-085/mark-anderson/raku/ch-1.p6
index fe36eac9c6..3fa3de6fb5 100644
--- a/challenge-085/mark-anderson/raku/ch-1.p6
+++ b/challenge-085/mark-anderson/raku/ch-1.p6
@@ -12,7 +12,7 @@ multi MAIN {
 }
    
 sub triplet-sum(@R) {
-    @R.grep(0 < * < 2)
+    @R.grep(* < 2)
       .combinations(3)
       .map(*.sum)
       .first(1 < * < 2)
-- 
cgit 


From d1fb582725dd5283e58788d5d3c0a167e322753e Mon Sep 17 00:00:00 2001
From: Mark Anderson <mark@frontrangerunner.com>
Date: Mon, 2 Nov 2020 05:32:00 -0700
Subject: Challenge 85 Solutions (Raku)

---
 challenge-085/mark-anderson/raku/ch-1.p6 | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/challenge-085/mark-anderson/raku/ch-1.p6 b/challenge-085/mark-anderson/raku/ch-1.p6
index 3fa3de6fb5..8a4bf41553 100644
--- a/challenge-085/mark-anderson/raku/ch-1.p6
+++ b/challenge-085/mark-anderson/raku/ch-1.p6
@@ -15,7 +15,7 @@ sub triplet-sum(@R) {
     @R.grep(* < 2)
       .combinations(3)
       .map(*.sum)
-      .first(1 < * < 2)
+      .first(* ~~ 1..2)
       .Bool 
       .UInt 
 }
-- 
cgit 


From 8d3fc4efb17f963bad19e616abc193ef61a83e5b Mon Sep 17 00:00:00 2001
From: Mark Anderson <mark@frontrangerunner.com>
Date: Mon, 2 Nov 2020 05:40:20 -0700
Subject: Challenge 85 Solutions (Raku)

---
 challenge-085/mark-anderson/raku/ch-1.p6 | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/challenge-085/mark-anderson/raku/ch-1.p6 b/challenge-085/mark-anderson/raku/ch-1.p6
index 8a4bf41553..3fa3de6fb5 100644
--- a/challenge-085/mark-anderson/raku/ch-1.p6
+++ b/challenge-085/mark-anderson/raku/ch-1.p6
@@ -15,7 +15,7 @@ sub triplet-sum(@R) {
     @R.grep(* < 2)
       .combinations(3)
       .map(*.sum)
-      .first(* ~~ 1..2)
+      .first(1 < * < 2)
       .Bool 
       .UInt 
 }
-- 
cgit 


From 55ef6268e58f269be990061ad779008ae58f6f64 Mon Sep 17 00:00:00 2001
From: Mark Anderson <mark@frontrangerunner.com>
Date: Mon, 2 Nov 2020 05:47:06 -0700
Subject: Challenge 85 Solutions (Raku)

---
 challenge-085/mark-anderson/raku/ch-1.p6 | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/challenge-085/mark-anderson/raku/ch-1.p6 b/challenge-085/mark-anderson/raku/ch-1.p6
index 3fa3de6fb5..4d1e8737b1 100644
--- a/challenge-085/mark-anderson/raku/ch-1.p6
+++ b/challenge-085/mark-anderson/raku/ch-1.p6
@@ -1,4 +1,4 @@
-multi MAIN(*@R where { .all ~~ Real and .all > 0 }) {
+multi MAIN(*@R where .all > 0) {
     say triplet-sum(@R)
 }
  
-- 
cgit 


From 60ff040685463b8e4a338ef668e3a8e68bb9be57 Mon Sep 17 00:00:00 2001
From: Niels van Dijke <perlboy@cpan.org>
Date: Mon, 2 Nov 2020 12:48:22 +0000
Subject: Task 1 & 2

---
 challenge-085/perlboy1967/perl/ch-1.pl | 43 +++++++++++++++++++++++++
 challenge-085/perlboy1967/perl/ch-2.pl | 59 ++++++++++++++++++++++++++++++++++
 2 files changed, 102 insertions(+)
 create mode 100755 challenge-085/perlboy1967/perl/ch-1.pl
 create mode 100755 challenge-085/perlboy1967/perl/ch-2.pl

diff --git a/challenge-085/perlboy1967/perl/ch-1.pl b/challenge-085/perlboy1967/perl/ch-1.pl
new file mode 100755
index 0000000000..fbee3e306b
--- /dev/null
+++ b/challenge-085/perlboy1967/perl/ch-1.pl
@@ -0,0 +1,43 @@
+#!/usr/bin/perl
+
+# Perl Weekly Challenge - 085
+# - https://perlweeklychallenge.org/blog/perl-weekly-challenge-085/
+#
+# Task 1 - Triplet Sum
+#
+# Author: Niels 'PerlBoy' van Dijke
+
+use strict;
+use warnings;
+
+# Unbuffered STDOUT
+$|++;
+
+# Prototype
+sub between ($$$);
+
+use Algorithm::Combinatorics qw(combinations);
+use List::Util qw(sum);
+use Scalar::Util qw(looks_like_number);
+
+@ARGV = (1.2, 0.4, 0.1, 2.5)
+  unless scalar(@ARGV);
+
+die "Please provide minimally three real positive numbers"
+  unless (scalar @ARGV > 2 and
+          scalar grep {looks_like_number($_) and $_ > 0} @ARGV == scalar @ARGV);
+
+my $tripletsFound = 0;
+my $iter = combinations(\@ARGV, 3);
+while (my $ar = $iter->next) {
+  if (between(sum(@$ar),1,2)) {
+    printf "Triplet (%s) 'fits' (1.0 < %s < 2.0)\n", 
+      join(', ',@$ar), sum(@$ar);
+    $tripletsFound++;
+  }
+}
+print "No triplets found!\n" unless ($tripletsFound);
+
+sub between ($$$) {
+  return $_[0] > $_[1] && $_[0] < $_[2];
+}
diff --git a/challenge-085/perlboy1967/perl/ch-2.pl b/challenge-085/perlboy1967/perl/ch-2.pl
new file mode 100755
index 0000000000..436c0429e7
--- /dev/null
+++ b/challenge-085/perlboy1967/perl/ch-2.pl
@@ -0,0 +1,59 @@
+#!/usr/bin/perl
+
+# Perl Weekly Challenge - 085
+# - https://perlweeklychallenge.org/blog/perl-weekly-challenge-085/
+#
+# Task 2 - Power of Two integers
+# You are given a positive integer $N.
+#
+# Write a script to find if it can be expressed as a ^ b where a > 0 and b > 1. Print 1 if you succeed otherwise 0.
+#
+# Author: Niels 'PerlBoy' van Dijke
+
+use strict;
+use warnings;
+
+use Data::Printer;
+
+# Unbuffered STDOUT
+$|++;
+
+# Prototype(s)
+sub logN ($$);
+
+my ($N) = @ARGV;
+
+die "Please provide a positive integer"
+  unless (defined $N and $N =~ m#^[1-9][0-9]*$#);
+
+my @combinations;
+
+if ($N > 1) {
+  foreach my $b (2 .. int(logN($N,2))) {
+    for my $p (2 .. int(logN($N,$b))) {
+      push(@combinations,[$b,$p]) if ($b ** $p == $N);
+    }
+  }
+}
+
+print "Input: $N\n";
+if ($N == 1) {
+  printf "Output: 1 as 1 ^ x = 1 (where x > 1)\n";
+} else {
+  if (scalar @combinations) {
+    print "Output: 1 as\n";
+    printf "%s\n", join('', map { sprintf("\t%d = %d ^ %d\n", 
+                                          $N, $_->[0], $_->[1]) 
+                                } @combinations);
+  } else {
+    print "Output: 0\n";
+  }
+}
+
+
+sub logN ($$) {
+  return log(shift)/log(shift);
+}
+__END__
+my $res = log($N)/log(2);
+printf "$N %s %d\n", $res, ($res == int($res) ? 1 : 0)
-- 
cgit 


From ff60f93b7fa28efbce1b9e25ad4f6870b3967b0a Mon Sep 17 00:00:00 2001
From: Roger Bell_West <roger@firedrake.org>
Date: Mon, 2 Nov 2020 13:47:20 +0000
Subject: Solutions for challenge #85.

---
 challenge-085/roger-bell-west/perl/ch-1.pl   | 27 +++++++++++++++++++++++
 challenge-085/roger-bell-west/perl/ch-2.pl   | 24 +++++++++++++++++++++
 challenge-085/roger-bell-west/python/ch-1.py | 26 ++++++++++++++++++++++
 challenge-085/roger-bell-west/python/ch-2.py | 27 +++++++++++++++++++++++
 challenge-085/roger-bell-west/raku/ch-1.p6   | 20 +++++++++++++++++
 challenge-085/roger-bell-west/raku/ch-2.p6   | 22 +++++++++++++++++++
 challenge-085/roger-bell-west/ruby/ch-1.rb   | 30 ++++++++++++++++++++++++++
 challenge-085/roger-bell-west/ruby/ch-2.rb   | 32 ++++++++++++++++++++++++++++
 8 files changed, 208 insertions(+)
 create mode 100755 challenge-085/roger-bell-west/perl/ch-1.pl
 create mode 100755 challenge-085/roger-bell-west/perl/ch-2.pl
 create mode 100755 challenge-085/roger-bell-west/python/ch-1.py
 create mode 100755 challenge-085/roger-bell-west/python/ch-2.py
 create mode 100755 challenge-085/roger-bell-west/raku/ch-1.p6
 create mode 100755 challenge-085/roger-bell-west/raku/ch-2.p6
 create mode 100755 challenge-085/roger-bell-west/ruby/ch-1.rb
 create mode 100755 challenge-085/roger-bell-west/ruby/ch-2.rb

diff --git a/challenge-085/roger-bell-west/perl/ch-1.pl b/challenge-085/roger-bell-west/perl/ch-1.pl
new file mode 100755
index 0000000000..ac57525722
--- /dev/null
+++ b/challenge-085/roger-bell-west/perl/ch-1.pl
@@ -0,0 +1,27 @@
+#! /usr/bin/perl
+
+use strict;
+use warnings;
+
+use Test::More tests => 3;
+
+is(ts(1.2, 0.4, 0.1, 2.5),1,'example 1');
+is(ts(0.2, 1.5, 0.9, 1.1),0,'example 2');
+is(ts(0.5, 1.1, 0.3, 0.7),1,'example 3');
+
+use List::Util qw(sum);
+
+sub ts {
+  my @n=grep {$_ < 2} @_;
+  foreach my $a (0..$#n-2) {
+    foreach my $b ($a+1..$#n-1) {
+      foreach my $c ($b+1..$#n) {
+        my $s=sum(map {$n[$_]} ($a,$b,$c));
+        if ($s>1 && $s<2) {
+          return 1;
+        }
+      }
+    }
+  }
+  return 0;
+}
diff --git a/challenge-085/roger-bell-west/perl/ch-2.pl b/challenge-085/roger-bell-west/perl/ch-2.pl
new file mode 100755
index 0000000000..d155d41c7c
--- /dev/null
+++ b/challenge-085/roger-bell-west/perl/ch-2.pl
@@ -0,0 +1,24 @@
+#! /usr/bin/perl
+
+use strict;
+use warnings;
+
+use Test::More tests => 3;
+
+is(pti(8),1,'example 1');
+is(pti(15),0,'example 2');
+is(pti(125),1,'example 3');
+
+sub pti {
+  my $n=shift;
+  my $l=log($n);
+  foreach my $ca (2..int(sqrt($n))) {
+    my $bg=int($l/log($ca));
+    foreach my $cb ($bg,$bg+1) {
+      if ($ca ** $cb == $n) {
+        return 1;
+      }
+    }
+  }
+  return 0;
+}
diff --git a/challenge-085/roger-bell-west/python/ch-1.py b/challenge-085/roger-bell-west/python/ch-1.py
new file mode 100755
index 0000000000..08c5028f57
--- /dev/null
+++ b/challenge-085/roger-bell-west/python/ch-1.py
@@ -0,0 +1,26 @@
+#! /usr/bin/python3
+
+from itertools import combinations
+
+def ts(*a):
+    n=[x for x in a if x < 2]
+    for b in combinations(n,3):
+        s=sum(b)
+        if (s > 1 and s < 2):
+            return 1
+    return 0
+
+import unittest
+
+class TestTs(unittest.TestCase):
+
+    def test_ex1(self):
+        self.assertEqual(ts(1.2, 0.4, 0.1, 2.5),1,'example 1')
+
+    def test_ex2(self):
+        self.assertEqual(ts(0.2, 1.5, 0.9, 1.1),0,'example 2')
+
+    def test_ex3(self):
+        self.assertEqual(ts(0.5, 1.1, 0.3, 0.7),1,'example 3')
+
+unittest.main()
diff --git a/challenge-085/roger-bell-west/python/ch-2.py b/challenge-085/roger-bell-west/python/ch-2.py
new file mode 100755
index 0000000000..33c50139c2
--- /dev/null
+++ b/challenge-085/roger-bell-west/python/ch-2.py
@@ -0,0 +1,27 @@
+#! /usr/bin/python3
+
+from math import sqrt,log
+
+def pti(n):
+    l=log(n)
+    for ca in range(2,int(sqrt(n))+1):
+        bg=int(l/log(ca))
+        for cb in range(bg,bg+2):
+            if ca ** cb == n:
+                return 1
+    return 0
+
+import unittest
+
+class TestPti(unittest.TestCase):
+
+    def test_ex1(self):
+        self.assertEqual(pti(8),1,'example 1')
+
+    def test_ex2(self):
+        self.assertEqual(pti(15),0,'example 2')
+
+    def test_ex3(self):
+        self.assertEqual(pti(125),1,'example 3')
+
+unittest.main()
diff --git a/challenge-085/roger-bell-west/raku/ch-1.p6 b/challenge-085/roger-bell-west/raku/ch-1.p6
new file mode 100755
index 0000000000..dd2ff571a9
--- /dev/null
+++ b/challenge-085/roger-bell-west/raku/ch-1.p6
@@ -0,0 +1,20 @@
+#! /usr/bin/perl6
+
+use Test;
+
+plan 3;
+
+is(ts(1.2, 0.4, 0.1, 2.5),1,'example 1');
+is(ts(0.2, 1.5, 0.9, 1.1),0,'example 2');
+is(ts(0.5, 1.1, 0.3, 0.7),1,'example 3');
+
+sub ts(**@a) {
+  my @n=grep {$_ < 2}, @a;
+  for @a.combinations(3) -> @b {
+    my $s=sum(@b);
+    if ($s > 1 && $s < 2) {
+      return 1;
+    }
+  }
+  return 0;
+}
diff --git a/challenge-085/roger-bell-west/raku/ch-2.p6 b/challenge-085/roger-bell-west/raku/ch-2.p6
new file mode 100755
index 0000000000..bedf21f772
--- /dev/null
+++ b/challenge-085/roger-bell-west/raku/ch-2.p6
@@ -0,0 +1,22 @@
+#! /usr/bin/perl6
+
+use Test;
+
+plan 3;
+
+is(pti(8),1,'example 1');
+is(pti(15),0,'example 2');
+is(pti(125),1,'example 3');
+
+sub pti(Int $n) {
+  my $l=log($n);
+  for (2..floor(sqrt($n))) -> $ca {
+    my $bg=floor($l/log($ca));
+    for ($bg,$bg+1) -> $cb {
+      if ($ca ** $cb == $n) {
+        return 1;
+      }
+    }
+  }
+  return 0;
+}
diff --git a/challenge-085/roger-bell-west/ruby/ch-1.rb b/challenge-085/roger-bell-west/ruby/ch-1.rb
new file mode 100755
index 0000000000..7ef19b2ec3
--- /dev/null
+++ b/challenge-085/roger-bell-west/ruby/ch-1.rb
@@ -0,0 +1,30 @@
+#! /usr/bin/ruby
+
+def ts(*a)
+  n=a.find_all { |v| v<2 }
+  a.combination(3) do |b|
+    s=b.sum
+    if (s > 1 and s < 2)
+      return 1
+    end
+  end
+  return 0
+end
+
+require 'test/unit'
+
+class TestTs < Test::Unit::TestCase
+
+  def test_ex1
+    assert_equal(1,ts(1.2, 0.4, 0.1, 2.5))
+  end
+
+  def test_ex2
+    assert_equal(0,ts(0.2, 1.5, 0.9, 1.1))
+  end
+
+  def test_ex3
+    assert_equal(1,ts(0.5, 1.1, 0.3, 0.7))
+  end
+
+end
diff --git a/challenge-085/roger-bell-west/ruby/ch-2.rb b/challenge-085/roger-bell-west/ruby/ch-2.rb
new file mode 100755
index 0000000000..a226f96a02
--- /dev/null
+++ b/challenge-085/roger-bell-west/ruby/ch-2.rb
@@ -0,0 +1,32 @@
+#! /usr/bin/ruby
+
+def pti(n)
+  l=Math.log(n)
+  2.upto(Math.sqrt(n).floor) do |ca|
+    bg=(l/Math.log(ca)).floor
+    bg.upto(bg+1) do |cb|
+      if ca ** cb == n
+        return 1
+      end
+    end
+  end
+  return 0
+end
+
+require 'test/unit'
+
+class TestPti < Test::Unit::TestCase
+
+  def test_ex1
+    assert_equal(1,pti(8))
+  end
+
+  def test_ex2
+    assert_equal(0,pti(15))
+  end
+
+  def test_ex3
+    assert_equal(1,pti(125))
+  end
+
+end
-- 
cgit 


From 872f8d0248df759f5c357ec243744cc9764ceb72 Mon Sep 17 00:00:00 2001
From: Andrew Shitov <andy@shitov.ru>
Date: Mon, 2 Nov 2020 15:57:53 +0100
Subject: ash 085

---
 challenge-085/ash/blog.txt       |  1 +
 challenge-085/ash/raku/ch-1.raku |  7 +++++++
 challenge-085/ash/raku/ch-2.raku | 10 ++++++++++
 3 files changed, 18 insertions(+)
 create mode 100644 challenge-085/ash/blog.txt
 create mode 100644 challenge-085/ash/raku/ch-1.raku
 create mode 100644 challenge-085/ash/raku/ch-2.raku

diff --git a/challenge-085/ash/blog.txt b/challenge-085/ash/blog.txt
new file mode 100644
index 0000000000..7d89bc0ded
--- /dev/null
+++ b/challenge-085/ash/blog.txt
@@ -0,0 +1 @@
+https://andrewshitov.com/2020/11/02/raku-challenge-week-85/
diff --git a/challenge-085/ash/raku/ch-1.raku b/challenge-085/ash/raku/ch-1.raku
new file mode 100644
index 0000000000..c792d8ef13
--- /dev/null
+++ b/challenge-085/ash/raku/ch-1.raku
@@ -0,0 +1,7 @@
+#!/usr/bin/env raku
+#
+# Task 1 from
+# https://perlweeklychallenge.org/blog/perl-weekly-challenge-085/
+
+my @r = 1.2, 0.4, 0.1, 2.5;
+say +so 1 < any(@r.combinations(3)>>.sum) < 2;
diff --git a/challenge-085/ash/raku/ch-2.raku b/challenge-085/ash/raku/ch-2.raku
new file mode 100644
index 0000000000..e18abbd7ce
--- /dev/null
+++ b/challenge-085/ash/raku/ch-2.raku
@@ -0,0 +1,10 @@
+#!/usr/bin/env raku
+#
+# Task 2 from
+# https://perlweeklychallenge.org/blog/perl-weekly-challenge-085/
+
+my $N = @*ARGS[0] // 8;
+
+for 1..^$N X ^$N -> ($a, $b) {
+    say "$N = $a^$b" if $N == $a ** $b;
+}
-- 
cgit 


From b88d0018e8e7ec33fb5c774507ea440acfd9b3e7 Mon Sep 17 00:00:00 2001
From: Philip Hood <hood@panix.com>
Date: Mon, 2 Nov 2020 12:42:47 -0500
Subject: c++ solutions for ch's 1 & 2 in c++ ...

---
 challenge-085/pkmnx/c++/ch-1/Makefile     |  4 ++
 challenge-085/pkmnx/c++/ch-1/ch-1.cpp     | 64 +++++++++++++++++++++++++++++++
 challenge-085/pkmnx/c++/ch-1/sample.input |  4 ++
 challenge-085/pkmnx/c++/ch-2/Makefile     |  4 ++
 challenge-085/pkmnx/c++/ch-2/ch-2.cpp     | 47 +++++++++++++++++++++++
 5 files changed, 123 insertions(+)
 create mode 100644 challenge-085/pkmnx/c++/ch-1/Makefile
 create mode 100644 challenge-085/pkmnx/c++/ch-1/ch-1.cpp
 create mode 100644 challenge-085/pkmnx/c++/ch-1/sample.input
 create mode 100644 challenge-085/pkmnx/c++/ch-2/Makefile
 create mode 100644 challenge-085/pkmnx/c++/ch-2/ch-2.cpp

diff --git a/challenge-085/pkmnx/c++/ch-1/Makefile b/challenge-085/pkmnx/c++/ch-1/Makefile
new file mode 100644
index 0000000000..5ad1c62a72
--- /dev/null
+++ b/challenge-085/pkmnx/c++/ch-1/Makefile
@@ -0,0 +1,4 @@
+all:
+	g++ -o ch-1 ch-1.cpp -Wall -pedantic -ansi
+clean:
+	rm *.o
diff --git a/challenge-085/pkmnx/c++/ch-1/ch-1.cpp b/challenge-085/pkmnx/c++/ch-1/ch-1.cpp
new file mode 100644
index 0000000000..d87629395f
--- /dev/null
+++ b/challenge-085/pkmnx/c++/ch-1/ch-1.cpp
@@ -0,0 +1,64 @@
+#include <vector>
+#include <map>
+#include <iostream>
+#include <bits/stdc++.h>
+
+using namespace std;
+ 
+void permute( vector<double> v ) {
+
+   sort( v.begin(), v.end() );
+
+   map<double, map <double, map <double, bool> > > m;
+
+   do {
+
+      double a = v[0];
+      double b = v[1];
+      double c = v[2];
+
+      if ( m[ a ][ b ][ c ] ) {
+         // nothing ...
+
+      } else {
+
+         m[ a ][ b ][ c ] = true;
+
+         double sum = a + b + c;
+         if ( sum > 1 && sum < 2 ) {
+            cout << "Output: 1 as 1 < " << a << " + " << b << " + " << c <<  " < 2" << endl;
+            exit(0);
+         }
+
+      }
+
+   } while ( next_permutation( v.begin(), v.end() ) );
+
+}
+ 
+int main() {
+
+   vector<double> v;
+
+   double x;
+   while ( cin >> x ) { v.push_back(x); }
+
+   if ( v.size() > 0 ) {
+
+      cout << "Input: @R = (" << v[0];
+
+      for ( std::vector<double>::size_type i = 1; i < v.size(); i++ ) {
+         cout << ", " << v[i];
+      }
+ 
+      cout << ")" << endl;
+
+      permute(v);
+
+   }
+
+   cout << "Output: 0\n";
+
+   return 0;
+
+}
diff --git a/challenge-085/pkmnx/c++/ch-1/sample.input b/challenge-085/pkmnx/c++/ch-1/sample.input
new file mode 100644
index 0000000000..0c56ca41e6
--- /dev/null
+++ b/challenge-085/pkmnx/c++/ch-1/sample.input
@@ -0,0 +1,4 @@
+0.5
+1.1
+0.3
+0.7
diff --git a/challenge-085/pkmnx/c++/ch-2/Makefile b/challenge-085/pkmnx/c++/ch-2/Makefile
new file mode 100644
index 0000000000..daa4fd0e5f
--- /dev/null
+++ b/challenge-085/pkmnx/c++/ch-2/Makefile
@@ -0,0 +1,4 @@
+all:
+	g++ -o ch-2 ch-2.cpp -Wall -pedantic -ansi
+clean:
+	rm *.o
diff --git a/challenge-085/pkmnx/c++/ch-2/ch-2.cpp b/challenge-085/pkmnx/c++/ch-2/ch-2.cpp
new file mode 100644
index 0000000000..bcb18bbd92
--- /dev/null
+++ b/challenge-085/pkmnx/c++/ch-2/ch-2.cpp
@@ -0,0 +1,47 @@
+#include <bits/stdc++.h>
+#include <iostream>
+#include <math.h>
+
+using namespace std;
+
+int main() {
+
+   long n;
+   cin >> n;
+
+   if ( n < 0 ) { 
+      cout << "Input: " << n << " is not positive." << endl;
+      exit(0);
+   }
+   if ( n > INT_MAX ) { 
+      cout << "Input: " << n << " is greater than INT_MAX: " << INT_MAX << endl;
+      exit(0);
+   }
+
+   cout << "Input: " << n << endl;
+
+   for ( int i = 2; i <= n; ++i ) {
+      if ( n % i == 0 ) {
+
+         for ( int j = 2; j < INT_MAX; j++ ) {
+
+            long ij = 1;
+            for ( int k = 0; k < j; k++ ) {
+               ij *= i;
+               if ( ij > n ) { break; }
+            }
+            if ( ij > n ) { break; }
+
+            if ( ij == n ) {
+               cout << "Output: 1 as " << n << " = " << i << " ^ " << j << endl;
+               exit(0);
+            }
+
+         }
+      
+      }
+   }
+
+   cout << "Output: 0" << endl;
+   return 0;
+}
-- 
cgit 


From b83d07f8a65d0ebba27ebba2bdf08381024d024a Mon Sep 17 00:00:00 2001
From: tagg <lars@thegler.dk>
Date: Mon, 2 Nov 2020 22:24:44 +0100
Subject: Solutions for challenge 085

---
 challenge-085/lars-thegler/perl/ch-1.pl | 36 +++++++++++++++++++++++++++++
 challenge-085/lars-thegler/perl/ch-2.pl | 40 +++++++++++++++++++++++++++++++++
 2 files changed, 76 insertions(+)
 create mode 100644 challenge-085/lars-thegler/perl/ch-1.pl
 create mode 100644 challenge-085/lars-thegler/perl/ch-2.pl

diff --git a/challenge-085/lars-thegler/perl/ch-1.pl b/challenge-085/lars-thegler/perl/ch-1.pl
new file mode 100644
index 0000000000..95947c6fca
--- /dev/null
+++ b/challenge-085/lars-thegler/perl/ch-1.pl
@@ -0,0 +1,36 @@
+#!/usr/bin/env perl
+
+use Modern::Perl;
+
+# TASK #1 › Triplet Sum
+# Submitted by: Mohammad S Anwar
+# You are given an array of real numbers greater than zero.
+
+# Write a script to find if there exists a triplet (a,b,c) such that 1 < a+b+c < 2. Print 1 if you succeed otherwise 0.
+
+# Example 1:
+# Input: @R = (1.2, 0.4, 0.1, 2.5)
+# Output: 1 as 1 < 1.2 + 0.4 + 0.1 < 2
+# Example 2:
+# Input: @R = (0.2, 1.5, 0.9, 1.1)
+# Output: 0
+# Example 3:
+# Input: @R = (0.5, 1.1, 0.3, 0.7)
+# Output: 1 as 1 < 0.5 + 1.1 + 0.3 < 2
+
+my @R = @ARGV;
+
+for my $a (@R) {    # choose a from the list of numbers
+    my @R = grep { $_ != $a } @R;    # remaining numbers, without the a we chose
+    for my $b (@R) {                 # choose b from the remainder
+        my @R = grep { $_ != $b } @R;    # remaining numbers, without the a and b we chose
+        for my $c (@R) {                 # choose c from the remainder
+            my $sum = $a + $b + $c;      # do the validation
+            if ( 1 < $sum && $sum < 2 ) {
+                say 1;
+                exit;
+            }
+        }
+    }
+}
+say 0;
diff --git a/challenge-085/lars-thegler/perl/ch-2.pl b/challenge-085/lars-thegler/perl/ch-2.pl
new file mode 100644
index 0000000000..da3406a56b
--- /dev/null
+++ b/challenge-085/lars-thegler/perl/ch-2.pl
@@ -0,0 +1,40 @@
+#!/usr/bin/env perl
+
+use Modern::Perl;
+
+# TASK #2 › Power of Two Integers
+# Submitted by: Mohammad S Anwar
+# You are given a positive integer $N.
+
+# Write a script to find if it can be expressed as a ^ b where a > 0 and b > 1. Print 1 if you succeed otherwise 0.
+
+# Example 1:
+# Input: 8
+# Output: 1 as 8 = 2 ^ 3
+# Example 2:
+# Input: 15
+# Output: 0
+# Example 3:
+# Input: 125
+# Output: 1 as 125 = 5 ^ 3
+
+my $N = shift;
+
+if ( $N == 1 ) {
+    say 1;
+    exit;
+}
+
+for my $a ( 2 .. sqrt $N ) {
+    my $b = 1;
+    my $p;
+    do {
+        $b++;
+        $p = $a**$b;
+    } until $p >= $N;
+    if ( $p == $N ) {
+        say 1;
+        exit;
+    }
+}
+say 0;
-- 
cgit 


From 8681738405599bf44b461ea6b9b5640b1c80a05b Mon Sep 17 00:00:00 2001
From: Andrew Shitov <andy@shitov.ru>
Date: Mon, 2 Nov 2020 22:50:04 +0100
Subject: 085-1 in Python by ash

---
 challenge-085/ash/python/ch-1.py | 17 +++++++++++++++++
 1 file changed, 17 insertions(+)
 create mode 100644 challenge-085/ash/python/ch-1.py

diff --git a/challenge-085/ash/python/ch-1.py b/challenge-085/ash/python/ch-1.py
new file mode 100644
index 0000000000..502ef1d495
--- /dev/null
+++ b/challenge-085/ash/python/ch-1.py
@@ -0,0 +1,17 @@
+#!/usr/bin/env raku
+#
+# Task 1 from
+# https://perlweeklychallenge.org/blog/perl-weekly-challenge-085/#TASK1
+
+from itertools import combinations
+
+r = [1.2, 0.4, 0.1, 2.5]
+# r = [0.2, 1.5, 0.9, 1.1]
+
+for row in combinations(r, 3):
+    if 1 < sum(row) < 2:
+        print(1)
+        break
+        
+else:
+    print(0)
-- 
cgit 


From 3b2db7ec6c6da7dfea71afb68b7e7280a73af4cc Mon Sep 17 00:00:00 2001
From: Andrew Shitov <andy@shitov.ru>
Date: Mon, 2 Nov 2020 22:51:30 +0100
Subject: formatting

---
 challenge-085/ash/python/ch-1.py | 1 -
 1 file changed, 1 deletion(-)

diff --git a/challenge-085/ash/python/ch-1.py b/challenge-085/ash/python/ch-1.py
index 502ef1d495..4b0b1d285e 100644
--- a/challenge-085/ash/python/ch-1.py
+++ b/challenge-085/ash/python/ch-1.py
@@ -12,6 +12,5 @@ for row in combinations(r, 3):
     if 1 < sum(row) < 2:
         print(1)
         break
-        
 else:
     print(0)
-- 
cgit 


From 2fdc043b7f7afa6206b4c66a8989907572baad37 Mon Sep 17 00:00:00 2001
From: Andrew Shitov <andy@shitov.ru>
Date: Mon, 2 Nov 2020 22:52:44 +0100
Subject: use python

---
 challenge-085/ash/python/ch-1.py | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/challenge-085/ash/python/ch-1.py b/challenge-085/ash/python/ch-1.py
index 4b0b1d285e..008c3b951d 100644
--- a/challenge-085/ash/python/ch-1.py
+++ b/challenge-085/ash/python/ch-1.py
@@ -1,4 +1,4 @@
-#!/usr/bin/env raku
+#!/usr/bin/env python3
 #
 # Task 1 from
 # https://perlweeklychallenge.org/blog/perl-weekly-challenge-085/#TASK1
-- 
cgit 


From a5f7609a9fdafaa45e03c954d1a55ae3df3ec9de Mon Sep 17 00:00:00 2001
From: juliodcs <julio.dcs@gmail.com>
Date: Tue, 3 Nov 2020 01:04:40 +0100
Subject: juliodcs-week85

---
 challenge-085/juliodcs/perl/ch-1.pl   | 31 +++++++++++++++++++++++++++++++
 challenge-085/juliodcs/perl/ch-2.pl   | 30 ++++++++++++++++++++++++++++++
 challenge-085/juliodcs/raku/ch-1.raku | 22 ++++++++++++++++++++++
 challenge-085/juliodcs/raku/ch-2.raku | 29 +++++++++++++++++++++++++++++
 4 files changed, 112 insertions(+)
 create mode 100644 challenge-085/juliodcs/perl/ch-1.pl
 create mode 100644 challenge-085/juliodcs/perl/ch-2.pl
 create mode 100644 challenge-085/juliodcs/raku/ch-1.raku
 create mode 100644 challenge-085/juliodcs/raku/ch-2.raku

diff --git a/challenge-085/juliodcs/perl/ch-1.pl b/challenge-085/juliodcs/perl/ch-1.pl
new file mode 100644
index 0000000000..f25bbc6c98
--- /dev/null
+++ b/challenge-085/juliodcs/perl/ch-1.pl
@@ -0,0 +1,31 @@
+use strict;
+use warnings;
+use feature 'say';
+use experimental 'signatures';
+use List::Util 'sum0';
+
+sub triplet(@R) {
+    return 0 if @R < 3;
+    
+    my $sum = sum0((sort { $a cmp $b } @R)[0..2]);
+
+    return $sum > 1 && $sum < 2;
+}
+
+if (@ARGV > 0) {
+    say triplet(@ARGV);
+    exit 0;
+}
+
+use Test::More;
+
+ok !triplet(), 'Empty array cannot make triplet';
+ok !triplet(1), 'One element cannot make triplet';
+ok !triplet(1, 2), 'Two elements cannot make triplet';
+ok  triplet(1.5, 0, 0), 'Simple triplet';
+ok  triplet(0, 2, 3, 4, 5, 6, 7, 8, 9, 1.5, 0), 'Simple triplet with many numbers';
+ok  triplet(1.2, 0.4, 0.1, 2.5), 'Test case 1';
+ok !triplet(0.2, 1.5, 0.9, 1.1), 'Test case 2';
+ok  triplet(0.5, 1.1, 0.3, 0.7), 'Test case 3';
+
+done_testing;
diff --git a/challenge-085/juliodcs/perl/ch-2.pl b/challenge-085/juliodcs/perl/ch-2.pl
new file mode 100644
index 0000000000..ef85842801
--- /dev/null
+++ b/challenge-085/juliodcs/perl/ch-2.pl
@@ -0,0 +1,30 @@
+use strict;
+use warnings;
+use feature 'say';
+use experimental 'signatures';
+use Math::BigFloat;
+
+sub power_of_2_ints($number) {
+    my $num = Math::BigFloat->new($number);
+    foreach my $x (2 .. $num / 2) {
+        if ($num % $x == 0) {
+            my $log = log($num)/log($x);
+            return $log->bround(2) == int $log;
+        }
+    }
+    return 0;
+}
+
+if (@ARGV > 0) {
+    say power_of_2_ints(+shift);
+    exit 0;
+}
+
+use Test::More;
+
+ok  power_of_2_ints(4), '2^2 = 4';
+ok  power_of_2_ints(8), 'Test case 1';
+ok !power_of_2_ints(15), 'Test case 2';
+ok  power_of_2_ints(125), 'Test case 3';
+
+done_testing;
diff --git a/challenge-085/juliodcs/raku/ch-1.raku b/challenge-085/juliodcs/raku/ch-1.raku
new file mode 100644
index 0000000000..22addf0f52
--- /dev/null
+++ b/challenge-085/juliodcs/raku/ch-1.raku
@@ -0,0 +1,22 @@
+#! /usr/bin/raku
+
+multi triplet(*@R where *.elems < 3)               { 0 }
+multi triplet(*@R where 1 < @R.sort[0..2].sum < 2) { 1 }
+multi triplet(*@R)                                 { 0 }
+
+if @*ARGS.elems > 0 {
+    say triplet @*ARGS>>.FatRat;
+}
+
+use Test;
+
+ok !triplet(), 'Empty array cannot make triplet';
+ok !triplet(1), 'One element cannot make triplet';
+ok !triplet(1, 2), 'Two elements cannot make triplet';
+ok  triplet(1.5, 0, 0), 'Simple triplet';
+ok  triplet(0, 2, 3, 4, 5, 6, 7, 8, 9, 1.5, 0), 'Simple triplet with many numbers';
+ok  triplet(1.2, 0.4, 0.1, 2.5), 'Test case 1';
+ok !triplet(0.2, 1.5, 0.9, 1.1), 'Test case 2';
+ok  triplet(0.5, 1.1, 0.3, 0.7), 'Test case 3';
+
+done-testing;
diff --git a/challenge-085/juliodcs/raku/ch-2.raku b/challenge-085/juliodcs/raku/ch-2.raku
new file mode 100644
index 0000000000..bf48250fdd
--- /dev/null
+++ b/challenge-085/juliodcs/raku/ch-2.raku
@@ -0,0 +1,29 @@
+#! /usr/bin/raku
+
+sub power-of-ints($num where * > 0) {
+    my $base := (2 .. $num div 2).first: $num %% * or return False;
+    log($num, $base).round(1/10) == log($num, $base).round
+}
+
+if (@*ARGS.elems > 0) {
+    say power-of-ints @*ARGS.head.Int;
+    exit 0;
+}
+
+use Test;
+
+ok !power-of-ints(1), 'Number 1';
+ok  power-of-ints(4), '2^2 = 4';
+ok  power-of-ints(8), 'Test case 1';
+ok !power-of-ints(15), 'Test case 2';
+ok  power-of-ints(125), 'Test case 3';
+ok  power-of-ints(64), 'Test case 3';
+ok  power-of-ints(2197), '13^3';
+ok !power-of-ints(2198), '13^3 + 1';
+ok !power-of-ints(2196), '13^3 - 1';
+ok !power-of-ints(4394), '13^3 * 2';
+ok !power-of-ints(100 ** 100), 'Big number';
+ok !power-of-ints(199999), 'Big prime';
+ok  power-of-ints(199999 ** 20), 'Big prime base';
+
+done-testing;
-- 
cgit 


From d6ae6219de090690c41e9d871b1292f3cad58237 Mon Sep 17 00:00:00 2001
From: Samir Parikh <siparikh@gmail.com>
Date: Tue, 3 Nov 2020 03:25:57 +0000
Subject: add challenge 085 solutions

---
 challenge-085/samir-parikh/perl/blog.txt |  1 +
 challenge-085/samir-parikh/perl/ch-1.pl  | 22 ++++++++++++++++++++++
 challenge-085/samir-parikh/perl/ch-2.pl  | 20 ++++++++++++++++++++
 3 files changed, 43 insertions(+)
 create mode 100644 challenge-085/samir-parikh/perl/blog.txt
 create mode 100755 challenge-085/samir-parikh/perl/ch-1.pl
 create mode 100755 challenge-085/samir-parikh/perl/ch-2.pl

diff --git a/challenge-085/samir-parikh/perl/blog.txt b/challenge-085/samir-parikh/perl/blog.txt
new file mode 100644
index 0000000000..a15a1d0abc
--- /dev/null
+++ b/challenge-085/samir-parikh/perl/blog.txt
@@ -0,0 +1 @@
+https://samirparikh.com/blog/perl-weekly-challenge-085.html
diff --git a/challenge-085/samir-parikh/perl/ch-1.pl b/challenge-085/samir-parikh/perl/ch-1.pl
new file mode 100755
index 0000000000..e60e31c645
--- /dev/null
+++ b/challenge-085/samir-parikh/perl/ch-1.pl
@@ -0,0 +1,22 @@
+#!/usr/local/bin/perl
+
+use warnings;
+use strict;
+use feature 'say';
+use Algorithm::Combinatorics qw/combinations permutations/;
+use List::Util qw/sum/;
+
+# run program as:
+# $ ./ch-1.pl "0.5, 1.1, 0.3, 0.7"
+my @data = split /, /, $ARGV[0];
+my $citer = combinations(\@data, 3);
+my $notFound = 1;
+
+while (my $c = $citer->next) {
+