aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorWalt Mankowski <waltman@pobox.com>2020-09-28 19:37:09 -0400
committerWalt Mankowski <waltman@pobox.com>2020-09-28 19:37:09 -0400
commita1353111f06f01eae1a495e431aa954d93124bde (patch)
treed4624e486457c817ae0a6091ea7937f0049a1560
parentaa14cbf8342e04b936f40bcc720a23a258137ecd (diff)
downloadperlweeklychallenge-club-a1353111f06f01eae1a495e431aa954d93124bde.tar.gz
perlweeklychallenge-club-a1353111f06f01eae1a495e431aa954d93124bde.tar.bz2
perlweeklychallenge-club-a1353111f06f01eae1a495e431aa954d93124bde.zip
perl code for challenge 80 task 1
-rw-r--r--challenge-080/walt-mankowski/perl/ch-1.pl24
1 files changed, 24 insertions, 0 deletions
diff --git a/challenge-080/walt-mankowski/perl/ch-1.pl b/challenge-080/walt-mankowski/perl/ch-1.pl
new file mode 100644
index 0000000000..fd08ac491f
--- /dev/null
+++ b/challenge-080/walt-mankowski/perl/ch-1.pl
@@ -0,0 +1,24 @@
+#!/usr/bin/env perl
+use strict;
+use warnings;
+use feature qw(:5.32);
+use experimental qw(signatures);
+
+# TASK #1 › Smallest Positive Number Bits
+# Submitted by: Mohammad S Anwar
+#
+# You are given unsorted list of integers @N.
+#
+# Write a script to find out the smallest positive number missing.
+
+my %h = map { $_ => 1 } @ARGV;
+
+my $n = 1;
+while (1) {
+ if (defined $h{$n}) {
+ $n++;
+ } else {
+ say $n;
+ last;
+ }
+}