aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
-rw-r--r--challenge-113/james-smith/README.md6
1 files changed, 2 insertions, 4 deletions
diff --git a/challenge-113/james-smith/README.md b/challenge-113/james-smith/README.md
index 621fc13607..2faccc1254 100644
--- a/challenge-113/james-smith/README.md
+++ b/challenge-113/james-smith/README.md
@@ -12,11 +12,9 @@ You can find the solutions here on github at:
https://github.com/drbaggy/perlweeklychallenge-club/tree/master/challenge-113/james-smith/perl
-# Challenge 1 - Canonical Path
+# Challenge 1 - epresent Integer
-**TASK #1: Represent Integer
-
-You are given a positive integer `$N` and a digit `$D`. Write a script to
+**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 check passes print `1` otherwise `0`.**