solving waiter

Author: prabaprakash

waiter.js

@@ -0,0 +1,86 @@
+'use strict';
+
+const fs = require('fs');
+
+process.stdin.resume();
+process.stdin.setEncoding('utf-8');
+
+let inputString = '';
+let currentLine = 0;
+
+process.stdin.on('data', inputStdin => {
+    inputString += inputStdin;
+});
+
+process.stdin.on('end', _ => {
+    inputString = inputString.trim().split('\n').map(str => str.trim());
+
+    main();
+});
+
+function readLine() {
+    return inputString[currentLine++];
+}
+
+/*
+ * Complete the waiter function below.
+ */
+
+function sieve(n) {
+    let prime = Array(n + 1).fill(true);
+    for (var i = 2; i < Math.round(Math.sqrt(n)); i++) {
+        if (prime[i] !== false) {
+            for (var j = Math.pow(i, 2); j < n; j = j + i) {
+                prime[j] = false;
+            }
+        }
+    }
+    let p = [];
+    for (var j = 2; j < n; j++) {
+        if (prime[j] === true) p.push(j);
+    };
+    return p;
+}
+
+function waiter(number, qq, ws) {
+    let primenumbers = sieve(1200);
+    let a = [];
+    for (var i = 0; i < number.length; i++) {
+        if (number[i] % primenumbers[0] !== 0) {
+            a.push(number[i]);
+        } else {
+            ws.write(number[i] + "\n");
+        }
+    }
+    for (let q = 1; q < qq; q++) {
+        let c = [];
+        while (a.length > 0) {
+            let val = a.pop();
+            if (val % primenumbers[q] !== 0) {
+                c.push(val);
+            }
+            else {
+                ws.write(val + "\n");
+            }
+        }
+        a = c;
+    }
+    a.forEach(x => ws.write(x + "\n"));
+}
+
+
+function main() {
+    const ws = fs.createWriteStream(process.env.OUTPUT_PATH);
+
+    const nq = readLine().split(' ');
+
+    const n = parseInt(nq[0], 10);
+
+    const q = parseInt(nq[1], 10);
+
+    const number = readLine().split(' ').map(numberTemp => parseInt(numberTemp, 10));
+
+    waiter(number, q, ws);
+
+    ws.end();
+}