chore: some algs

Author: ceilf6

JS/algorithm/mT/jiYin.js

@@ -0,0 +1,17 @@
+const rl = require("readline").createInterface({ input: process.stdin });
+var iter = rl[Symbol.asyncIterator]();
+const readline = async () => (await iter.next()).value;
+
+void (async function () {
+    let l;
+    let r;
+    while ((line = await readline())) {
+        let tokens = line.split(" ");
+        l = parseInt(tokens[0]);
+        r = parseInt(tokens[1]);
+        // console.log(a + b);
+    }
+    const rF = Math.floor(Math.pow(r, 1 / 2));
+    const lF = Math.ceil(Math.pow(l, 1 / 2));
+    console.log(rF - lF + 1);
+})();

JS/algorithm/mT/kFeiBo.js

@@ -0,0 +1,35 @@
+const rl = require("readline").createInterface({ input: process.stdin });
+var iter = rl[Symbol.asyncIterator]();
+const readline = async () => (await iter.next()).value;
+
+void (async function () {
+    let kq;
+    let flag = true;
+    const query = [];
+    while ((line = await readline())) {
+        // console.log(line)
+        if (flag) {
+            kq = line.split(" ");
+            // console.log(kq)
+            flag = false;
+        } else {
+            query.push(Number(line));
+        }
+    }
+    k = Number(kq[0]);
+    q = Number(kq[1]);
+
+    const f = new Array(k).fill(1);
+    f.push(k);
+    let cur = k;
+    const nMax = Math.max(...query);
+    // console.log(nMax)
+    const BASE = 10 ** 9 + 7;
+    for (let i = 0; i < nMax - k; i++) {
+        cur = cur - f[i] + f[i + k];
+        f.push(cur % BASE);
+    }
+    for (const que of query) {
+        console.log(f[que - 1]);
+    }
+})();