""" Problem Description Given a number N, you have to find the largest Fibonacci number which is less than N. Input Format First line contains an integer T - Number of test cases. Next T lines each have a given number N Output Format Print the answer for each test case in a separate line. Sample Input 1 2 6 13 Sample Output 1 5 8 Explanation 1 In the first test case the largest Fibonacci number less than 6 is 5. In the second test case the largest Fibonacci number less than 13 is 8 (the next Fibonacci number after 8 is 13 which is equal to the number N i.e. 13) Constraints T <= 10^4 0 < N <= 10^9 """ Please help me to debug the below code based on details given above and return the updated full version of code. """ 'use strict'; 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(string => { return string.replace(/\s+/g, " ").trim(); }); main(); }); function readLine() { return inputString[currentLine++]; } function readIntArr() { let str = readLine(); str = str.split(" "); let arr = []; for ( let i = 0; i < str.length; i++ ) { arr.push(parseInt(str[i], 10)); } return arr; } function print(x) { process.stdout.write(x + ""); } function largestFibonacciNumber(n) { let a = 0; let b = 1; while (b <= n) { a = b; b = a + b; } return a; } function main() { let t=parseInt(readLine(),10); while(t--){ let n=parseInt(readLine(),10) let result=largestFibonacciNumber(n); console.log(result); } } """
Preview:
downloadDownload PNG
downloadDownload JPEG
downloadDownload SVG
Tip: You can change the style, width & colours of the snippet with the inspect tool before clicking Download!
Click to optimize width for Twitter