Fibonacci_Divisibility_Advanced.js

// js solution to codeabbey challenge 71
function getidxfib(mod){
    let fib1 = 0;
    let fib2 = 1;
    let fib3 = 0;
    let idx = 2;
    while (true){
        fib3 = (fib1 + fib2) % mod;
        if (fib3 % mod === 0){
          return idx.toString();
        }
        fib1 = fib2;
        fib2 = fib3;
        idx++;
    }
}

N_CASES = 19;
CASES = [449825, 940999, 891051, 674588, 241652, 1049193, 1024240, 857743, 408165, 641261, 349920, 1015891, 982578, 291607, 657942, 374884, 508055, 458138, 732856];
RSP = [];
for (var i = 0; i < CASES.length; i++) {
    RSP.push(getidxfib(CASES[i]))
}
console.log(RSP.join(" "));