Merge pull request #7477 from pokgopun/pwc201

pwc201/perl

2 files changed, 34 insertions, 0 deletions

diff --git a/challenge-201/pokgopun/perl/ch-1.pl b/challenge-201/pokgopun/perl/ch-1.pl
new file mode 100644
index 0000000000..aa58f14b86
--- /dev/null
+++ b/challenge-201/pokgopun/perl/ch-1.pl
@@ -0,0 +1,11 @@
+use strict;
+use warnings;
+
+@ARGV = (0,1,3) unless join("",@ARGV) =~ /^\d+$/; ### default array to example1 if not provided via arguments
+
+my %seen;
+foreach (@ARGV){
+	die "not an array of unique numbers" if $seen{$_}++;
+}
+
+printf "Input: array = %s\nOutput: %s\n", join(", ", sort{$a<=>$b} @ARGV), join(", ", grep{!$seen{$_}} 0..$#ARGV+1);
diff --git a/challenge-201/pokgopun/perl/ch-2.pl b/challenge-201/pokgopun/perl/ch-2.pl
new file mode 100644
index 0000000000..5fa6bfc94f
--- /dev/null
+++ b/challenge-201/pokgopun/perl/ch-2.pl
@@ -0,0 +1,23 @@
+use strict;
+use warnings;
+
+my $n = $ARGV[0] && $ARGV[0] =~ /^\d+$/ ? $ARGV[0] : 5; ### n default to 5 unless a number is provided as an argument
+my %seen; ### hash to put "number of ways" as keys
+
+### function that take n to generate "number of ways" and put them as keys of %seen
+sub penny{
+	my $p = shift @_;
+	{
+		last if $p;
+		$seen{join(" ",sort {$b<=>$a} @_)}++; ### sort "number of ways" so they can be deduped
+		return
+	}
+	foreach (1..$p) {
+		penny($p-$_,$_,@_);
+	}
+}
+
+penny($n);
+my $p = keys %seen;
+printf "Input: n = %d\nOutput: %d\n\nThere are %d ways of stacking %d pennies in ascending piles:\n\n", $n, $p, $p, $n;
+printf("\t%s\n",$_) foreach sort keys %seen;