aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorAdam Russell <ac.russell@live.com>2021-05-23 15:37:44 -0400
committerAdam Russell <ac.russell@live.com>2021-05-23 15:37:44 -0400
commit8d7aa571a4ad953fe67692ed3beec61c406eed21 (patch)
tree6230379ea4ca5db7f57fa4aa6a49d33397a7681a
parentf501e45851ecdaefb11362cc511001eaf46b86da (diff)
downloadperlweeklychallenge-club-8d7aa571a4ad953fe67692ed3beec61c406eed21.tar.gz
perlweeklychallenge-club-8d7aa571a4ad953fe67692ed3beec61c406eed21.tar.bz2
perlweeklychallenge-club-8d7aa571a4ad953fe67692ed3beec61c406eed21.zip
Updated Perl solution to Task #1.
-rw-r--r--challenge-113/adam-russell/perl/ch-1.pl5
1 files changed, 4 insertions, 1 deletions
diff --git a/challenge-113/adam-russell/perl/ch-1.pl b/challenge-113/adam-russell/perl/ch-1.pl
index 6f9714010d..ca77eb766d 100644
--- a/challenge-113/adam-russell/perl/ch-1.pl
+++ b/challenge-113/adam-russell/perl/ch-1.pl
@@ -1,7 +1,10 @@
use strict;
use warnings;
##
-#
+# You are given a positive integer $N and a digit $D.
+# Write a script to check if $N can be represented as
+# a sum of positive integers having $D at least once.
+# If the check passes print 1 otherwise 0.
##
sub is_represented{
my($n, $d) = @_;