Fibonacci_Divisibility_Advanced.coffee

# coffeescript solution to codeabbey challenge 71
getidxfib =(mod) ->
    fib1 = 0; fib2=1; fib3 = 0; idx = 2
    while true
        fib3 = (fib1 + fib2) % mod
        if fib3 % mod == 0
            return idx
        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 = [getidxfib(c) for c in CASES]
count = 0
o = ""
while count < RSP.length
    o = o + RSP[count] + " "
    count++;

console.log o