Node.js solution for week 113

3 files changed, 49 insertions, 0 deletions

diff --git a/challenge-113/abigail/README.md b/challenge-113/abigail/README.md
index 3d3183a0d1..34146af125 100644
--- a/challenge-113/abigail/README.md
+++ b/challenge-113/abigail/README.md
@@ -22,6 +22,7 @@ Output: 1
 * [Bash](bash/ch-1.sh)
 * [C](c/ch-1.c)
 * [Lua](lua/ch-1.lua)
+* [Node.js](node/ch-1.js)
 * [Perl](perl/ch-1.pl)
 
 ### Blog
@@ -61,6 +62,7 @@ Output: 1
 * [Bash](bash/ch-2.sh)
 * [C](c/ch-2.c)
 * [Lua](lua/ch-2.lua)
+* [Node.js](node/ch-2.js)
 * [Perl](perl/ch-2.pl)
 
 ### Blog
diff --git a/challenge-113/abigail/node/ch-1.js b/challenge-113/abigail/node/ch-1.js
new file mode 100644
index 0000000000..2ca4f6a0e1
--- /dev/null
+++ b/challenge-113/abigail/node/ch-1.js
@@ -0,0 +1,30 @@
+#!/usr/local/bin/node
+
+//
+// See ../README.md
+//
+
+//
+// Run as: node ch-1.js < input-file
+//
+
+let tens = [0, 0, 1, 2, 1, 0, 2, 6, 3, 8];
+
+require ('readline')
+. createInterface ({input: process . stdin})   
+. on ('line', _ => {
+    let [N, D] = _ . split (/\s+/) . map (_ => +_)
+    let D10 = D == 0 ? 100 : 10 * D
+    if (N >= D10 || (N % (D == 0 ? 10 : D) == 0)) {
+        console . log (1)
+        return
+    }
+    for (let i = 1; i <= tens [D]; i ++) {
+        let T = N - 10 * i - D
+        if (T >= 0 && T % D == 0) {
+            console . log (1)
+            return
+        }
+    }
+    console . log (0)
+})
diff --git a/challenge-113/abigail/node/ch-2.js b/challenge-113/abigail/node/ch-2.js
new file mode 100644
index 0000000000..606e95d09d
--- /dev/null
+++ b/challenge-113/abigail/node/ch-2.js
@@ -0,0 +1,17 @@
+#!/usr/local/bin/node
+
+//
+// See ../README.md
+//
+
+//
+// Run as: node ch-2.js < input-file
+//
+
+require ('readline')
+. createInterface ({input: process . stdin})   
+. on ('line', _ => {
+    let numbers = _ . split (/\s+/) . map (_ => +_)
+    let sum     = numbers . reduce ((acc, val) => acc + val)
+    console . log (numbers . map (_ => sum - _) . join (" "))
+})