Tasks Details
medium
1.
FibFrog
Count the minimum number of jumps required for a frog to get to the other side of a river.
Task Score
100%
Correctness
100%
Performance
100%
The Fibonacci sequence is defined using the following recursive formula:
F(0) = 0 F(1) = 1 F(M) = F(M - 1) + F(M - 2) if M >= 2A small frog wants to get to the other side of a river. The frog is initially located at one bank of the river (position −1) and wants to get to the other bank (position N). The frog can jump over any distance F(K), where F(K) is the K-th Fibonacci number. Luckily, there are many leaves on the river, and the frog can jump between the leaves, but only in the direction of the bank at position N.
The leaves on the river are represented in an array A consisting of N integers. Consecutive elements of array A represent consecutive positions from 0 to N − 1 on the river. Array A contains only 0s and/or 1s:
- 0 represents a position without a leaf;
- 1 represents a position containing a leaf.
The goal is to count the minimum number of jumps in which the frog can get to the other side of the river (from position −1 to position N). The frog can jump between positions −1 and N (the banks of the river) and every position containing a leaf.
For example, consider array A such that:
A[0] = 0 A[1] = 0 A[2] = 0 A[3] = 1 A[4] = 1 A[5] = 0 A[6] = 1 A[7] = 0 A[8] = 0 A[9] = 0 A[10] = 0The frog can make three jumps of length F(5) = 5, F(3) = 2 and F(5) = 5.
Write a function:
function solution(A);
that, given an array A consisting of N integers, returns the minimum number of jumps by which the frog can get to the other side of the river. If the frog cannot reach the other side of the river, the function should return −1.
For example, given:
A[0] = 0 A[1] = 0 A[2] = 0 A[3] = 1 A[4] = 1 A[5] = 0 A[6] = 1 A[7] = 0 A[8] = 0 A[9] = 0 A[10] = 0the function should return 3, as explained above.
Write an efficient algorithm for the following assumptions:
- N is an integer within the range [0..100,000];
- each element of array A is an integer that can have one of the following values: 0, 1.
Copyright 2009–2025 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used JavaScript
Time spent on task 26 minutes
Notes
not defined yet
Code: 19:37:02 UTC,
java,
autosave
Code: 19:37:18 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N + 1) break;
fibs.push(nextFib);
index++;
}
index = -1;
let count = 0;
while (index < N) {
let fibIndex = fibs.length - 1;
while (A[index + fibs[fibIndex]] !== 1) {
if (index + fibs[fibIndex] === N) break;
if (fibIndex === 0) return -1;
fibIndex--;
}
count++;
index += fibs[fibIndex];
}
return count;
}
Code: 19:37:28 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N + 1) break;
fibs.push(nextFib);
index++;
}
console.log(fibs);
index = -1;
let count = 0;
while (index < N) {
let fibIndex = fibs.length - 1;
while (A[index + fibs[fibIndex]] !== 1) {
if (index + fibs[fibIndex] === N) break;
if (fibIndex === 0) return -1;
fibIndex--;
}
count++;
index += fibs[fibIndex];
}
return count;
}
Analysis
Code: 19:37:55 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
A.
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N + 1) break;
fibs.push(nextFib);
index++;
}
console.log(fibs);
index = -1;
let count = 0;
while (index < N) {
let fibIndex = fibs.length - 1;
while (A[index + fibs[fibIndex]] !== 1) {
if (index + fibs[fibIndex] === N) break;
if (fibIndex === 0) return -1;
fibIndex--;
}
count++;
index += fibs[fibIndex];
}
return count;
}
Code: 19:38:07 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
A.push(1);
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N + 1) break;
fibs.push(nextFib);
index++;
}
console.log(fibs);
index = -1;
let count = 0;
while (index < N) {
let fibIndex = fibs.length - 1;
while (A[index + fibs[fibIndex]] !== 1) {
if (index + fibs[fibIndex] === N) break;
if (fibIndex === 0) return -1;
fibIndex--;
}
count++;
index += fibs[fibIndex];
}
return count;
}
Code: 19:38:27 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N + 1) break;
fibs.push(nextFib);
index++;
}
console.log(fibs);
index = -1;
let count = 0;
while (index < N) {
let fibIndex = fibs.length - 1;
while (A[index + fibs[fibIndex]] !== 1) {
if (index + fibs[fibIndex] === N) break;
if (fibIndex === 0) return -1;
fibIndex--;
}
count++;
index += fibs[fibIndex];
}
return count;
}
Code: 19:38:31 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
console.log(fibs);
index = -1;
let count = 0;
while (index < N) {
let fibIndex = fibs.length - 1;
while (A[index + fibs[fibIndex]] !== 1) {
if (index + fibs[fibIndex] === N) break;
if (fibIndex === 0) return -1;
fibIndex--;
}
count++;
index += fibs[fibIndex];
}
return count;
}
Analysis
expand all
Example tests
1.
0.076 s
WRONG ANSWER,
got 2 expected 3
stdout:
[ 1, 1, 2, 3, 5, 8 ]
Code: 19:38:36 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
console.log(fibs);
index = -1;
let count = 0;
while (index < N) {
let fibIndex = fibs.length - 1;
while (A[index + fibs[fibIndex]] !== 1) {
if (fibIndex === 0) return -1;
fibIndex--;
}
count++;
index += fibs[fibIndex];
}
return count;
}
Analysis
expand all
Example tests
1.
0.076 s
WRONG ANSWER,
got -1 expected 3
stdout:
[ 1, 1, 2, 3, 5, 8 ]
Code: 19:38:54 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
console.log(fibs);
index = -1;
let count = 0;
while (index <= N) {
let fibIndex = fibs.length - 1;
while (A[index + fibs[fibIndex]] !== 1) {
if (fibIndex === 0) return -1;
fibIndex--;
}
count++;
index += fibs[fibIndex];
}
return count;
}
Analysis
expand all
Example tests
1.
0.076 s
WRONG ANSWER,
got -1 expected 3
stdout:
[ 1, 1, 2, 3, 5, 8 ]
Code: 19:38:58 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
console.log(fibs);
index = -1;
let count = 0;
while (index < N) {
let fibIndex = fibs.length - 1;
while (A[index + fibs[fibIndex]] !== 1) {
if (fibIndex === 0) return -1;
fibIndex--;
}
count++;
index += fibs[fibIndex];
}
return count;
}
Code: 19:38:59 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
console.log(fibs);
index = -1;
let count = 0;
while (index < N) {
let fibIndex = fibs.length - 1;
while (A[index + fibs[fibIndex]] !== 1) {
if (fibIndex === 0) return -1;
fibIndex--;
}
count++;
index += fibs[fibIndex];
}
return count;
}
Analysis
expand all
Example tests
1.
0.076 s
WRONG ANSWER,
got -1 expected 3
stdout:
[ 1, 1, 2, 3, 5, 8 ]
Code: 19:44:37 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
console.log(fibs);
/*index = -1;
let count = 0;
while (index < N) {
let fibIndex = fibs.length - 1;
while (A[index + fibs[fibIndex]] !== 1) {
if (fibIndex === 0) return -1;
fibIndex--;
}
count++;
index += fibs[fibIndex];
}
return count;
}
Code: 19:44:51 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
console.log(fibs);
const
/*index = -1;
let count = 0;
while (index < N) {
let fibIndex = fibs.length - 1;
while (A[index + fibs[fibIndex]] !== 1) {
if (fibIndex === 0) return -1;
fibIndex--;
}
count++;
index += fibs[fibIndex];
}
return count;*/
}
Code: 19:45:22 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
console.log(fibs);
const reachable = new Array(N).fi
/*index = -1;
let count = 0;
while (index < N) {
let fibIndex = fibs.length - 1;
while (A[index + fibs[fibIndex]] !== 1) {
if (fibIndex === 0) return -1;
fibIndex--;
}
count++;
index += fibs[fibIndex];
}
return count;*/
}
Code: 19:45:32 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
console.log(fibs);
const reachable = new Array(N).fill(-1);
/*index = -1;
let count = 0;
while (index < N) {
let fibIndex = fibs.length - 1;
while (A[index + fibs[fibIndex]] !== 1) {
if (fibIndex === 0) return -1;
fibIndex--;
}
count++;
index += fibs[fibIndex];
}
return count;*/
}
Code: 19:45:54 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
console.log(fibs);
const reachable = new Array(N).fill(0);
for
/*index = -1;
let count = 0;
while (index < N) {
let fibIndex = fibs.length - 1;
while (A[index + fibs[fibIndex]] !== 1) {
if (fibIndex === 0) return -1;
fibIndex--;
}
count++;
index += fibs[fibIndex];
}
return count;*/
}
Code: 19:46:19 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
console.log(fibs);
const reachable = A.map((value) =>)
/*index = -1;
let count = 0;
while (index < N) {
let fibIndex = fibs.length - 1;
while (A[index + fibs[fibIndex]] !== 1) {
if (fibIndex === 0) return -1;
fibIndex--;
}
count++;
index += fibs[fibIndex];
}
return count;*/
}
Code: 19:46:37 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
console.log(fibs);
const reachable = A.map((value, index) => index)
/*index = -1;
let count = 0;
while (index < N) {
let fibIndex = fibs.length - 1;
while (A[index + fibs[fibIndex]] !== 1) {
if (fibIndex === 0) return -1;
fibIndex--;
}
count++;
index += fibs[fibIndex];
}
return count;*/
}
Code: 19:46:47 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
console.log(fibs);
const reachable =
/*index = -1;
let count = 0;
while (index < N) {
let fibIndex = fibs.length - 1;
while (A[index + fibs[fibIndex]] !== 1) {
if (fibIndex === 0) return -1;
fibIndex--;
}
count++;
index += fibs[fibIndex];
}
return count;*/
}
Code: 19:47:18 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
console.log(fibs);
const reachable = new Array(N).fill(0);
for (let i = 0; i < fibs.length; i++) {
}
/*index = -1;
let count = 0;
while (index < N) {
let fibIndex = fibs.length - 1;
while (A[index + fibs[fibIndex]] !== 1) {
if (fibIndex === 0) return -1;
fibIndex--;
}
count++;
index += fibs[fibIndex];
}
return count;*/
}
Code: 19:47:39 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
console.log(fibs);
const reachable = new Array(N).fill(0);
for (let i = 0; i < fibs.length; i++) {
if (A[i]) {
reachable[i] = 1;
}
}
console.log(reachable);
/*index = -1;
let count = 0;
while (index < N) {
let fibIndex = fibs.length - 1;
while (A[index + fibs[fibIndex]] !== 1) {
if (fibIndex === 0) return -1;
fibIndex--;
}
count++;
index += fibs[fibIndex];
}
return count;*/
}
Analysis
expand all
Example tests
1.
0.076 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, integer expected, 'undefined' found Perhaps you are missing a 'return'?stdout:
[ 1, 1, 2, 3, 5, 8 ] [ 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0 ]
Code: 19:47:49 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
console.log(fibs);
const reachable = new Array(N).fill(0);
for (let i = 0; i < fibs.length; i++) {
if (A[i]) {
reachable[i] = 1;
}
}
console.log(reachable);
for
/*index = -1;
let count = 0;
while (index < N) {
let fibIndex = fibs.length - 1;
while (A[index + fibs[fibIndex]] !== 1) {
if (fibIndex === 0) return -1;
fibIndex--;
}
count++;
index += fibs[fibIndex];
}
return count;*/
}
Code: 19:47:59 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
console.log(fibs);
const reachable = new Array(N).fill(0);
for (let i = 0; i < fibs.length; i++) {
if (A[i]) {
reachable[i] = 1;
}
}
console.log(reachable);
for (let i = 0; i < N; i++) {
}
/*index = -1;
let count = 0;
while (index < N) {
let fibIndex = fibs.length - 1;
while (A[index + fibs[fibIndex]] !== 1) {
if (fibIndex === 0) return -1;
fibIndex--;
}
count++;
index += fibs[fibIndex];
}
return count;*/
}
Code: 19:48:09 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
console.log(fibs);
const reachable = new Array(N).fill(0);
for (let i = 0; i < fibs.length; i++) {
if (A[i]) {
reachable[i] = 1;
}
}
console.log(reachable);
for (let i = 0; i < N; i++) {
if (A[i] || )
}
/*index = -1;
let count = 0;
while (index < N) {
let fibIndex = fibs.length - 1;
while (A[index + fibs[fibIndex]] !== 1) {
if (fibIndex === 0) return -1;
fibIndex--;
}
count++;
index += fibs[fibIndex];
}
return count;*/
}
Code: 19:48:40 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
console.log(fibs);
const reachable = new Array(N).fill(0);
for (let i = 0; i < fibs.length; i++) {
if (A[i]) {
reachable[i] = 1;
}
}
console.log(reachable);
for (let i = 0; i < N; i++) {
if (A[i] && !reachable[i]) {}
}
/*index = -1;
let count = 0;
while (index < N) {
let fibIndex = fibs.length - 1;
while (A[index + fibs[fibIndex]] !== 1) {
if (fibIndex === 0) return -1;
fibIndex--;
}
count++;
index += fibs[fibIndex];
}
return count;*/
}
Code: 19:48:45 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
console.log(fibs);
const reachable = new Array(N).fill(0);
for (let i = 0; i < fibs.length; i++) {
if (A[i]) {
reachable[i] = 1;
}
}
console.log(reachable);
for (let i = 0; i < N; i++) {
if (A[i] && !reachable[i]) {
console.log(i);
}
}
/*index = -1;
let count = 0;
while (index < N) {
let fibIndex = fibs.length - 1;
while (A[index + fibs[fibIndex]] !== 1) {
if (fibIndex === 0) return -1;
fibIndex--;
}
count++;
index += fibs[fibIndex];
}
return count;*/
}
Analysis
expand all
Example tests
1.
0.076 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, integer expected, 'undefined' found Perhaps you are missing a 'return'?stdout:
[ 1, 1, 2, 3, 5, 8 ] [ 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0 ] 6 11
Code: 19:49:11 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
console.log(fibs);
const reachable = new Array(N).fill(0);
for (let i = 0; i < fibs.length; i++) {
if (A[i]) {
reachable[i] = 1;
}
}
console.log(reachable);
for (let i = 0; i < N; i++) {
if (A[i] && !reachable[i]) {
for (let j = 0; j < fibs)
}
}
/*index = -1;
let count = 0;
while (index < N) {
let fibIndex = fibs.length - 1;
while (A[index + fibs[fibIndex]] !== 1) {
if (fibIndex === 0) return -1;
fibIndex--;
}
count++;
index += fibs[fibIndex];
}
return count;*/
}
Code: 19:49:21 UTC,
js,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
console.log(fibs);
const reachable = new Array(N).fill(0);
for (let i = 0; i < fibs.length; i++) {
if (A[i]) {
reachable[i] = 1;
}
}
console.log(reachable);
for (let i = 0; i < N; i++) {
if (A[i] && !reachable[i]) {
for (let j = 0; j < fibs.length; j++) {
}
}
}
/*index = -1;
let count = 0;
while (index < N) {
let fibIndex = fibs.length - 1;
while (A[index + fibs[fibIndex]] !== 1) {
if (fibIndex === 0) return -1;
fibIndex--;
}
count++;
index += fibs[fibIndex];
}
return count;*/
}
Code: 19:49:52 UTC,
js,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
console.log(fibs);
const reachable = new Array(N).fill(0);
for (let i = 0; i < fibs.length; i++) {
if (A[i]) {
reachable[i] = 1;
}
}
console.log(reachable);
for (let i = 0; i < N; i++) {
if (A[i] && !reachable[i]) {
let minJumps = Number.MAX_SAFE_INTEGER;
for (let j = 0; j < fibs.length; j++) {
const
}
}
}
/*index = -1;
let count = 0;
while (index < N) {
let fibIndex = fibs.length - 1;
while (A[index + fibs[fibIndex]] !== 1) {
if (fibIndex === 0) return -1;
fibIndex--;
}
count++;
index += fibs[fibIndex];
}
return count;*/
}
Code: 19:50:03 UTC,
js,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
console.log(fibs);
const reachable = new Array(N).fill(0);
for (let i = 0; i < fibs.length; i++) {
if (A[i]) {
reachable[i] = 1;
}
}
console.log(reachable);
for (let i = 0; i < N; i++) {
if (A[i] && !reachable[i]) {
let minJumps = Number.MAX_SAFE_INTEGER;
for (let j = 0; j < fibs.length; j++) {
const prev =
}
}
}
/*index = -1;
let count = 0;
while (index < N) {
let fibIndex = fibs.length - 1;
while (A[index + fibs[fibIndex]] !== 1) {
if (fibIndex === 0) return -1;
fibIndex--;
}
count++;
index += fibs[fibIndex];
}
return count;*/
}
Code: 19:50:14 UTC,
js,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
console.log(fibs);
const reachable = new Array(N).fill(0);
for (let i = 0; i < fibs.length; i++) {
if (A[i]) {
reachable[i] = 1;
}
}
console.log(reachable);
for (let i = 0; i < N; i++) {
if (A[i] && !reachable[i]) {
let minJumps = Number.MAX_SAFE_INTEGER;
for (let j = 0; j < fibs.length; j++) {
const prev = i -
}
}
}
/*index = -1;
let count = 0;
while (index < N) {
let fibIndex = fibs.length - 1;
while (A[index + fibs[fibIndex]] !== 1) {
if (fibIndex === 0) return -1;
fibIndex--;
}
count++;
index += fibs[fibIndex];
}
return count;*/
}
Code: 19:50:24 UTC,
js,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
console.log(fibs);
const reachable = new Array(N).fill(0);
for (let i = 0; i < fibs.length; i++) {
if (A[i]) {
reachable[i] = 1;
}
}
console.log(reachable);
for (let i = 0; i < N; i++) {
if (A[i] && !reachable[i]) {
let minJumps = Number.MAX_SAFE_INTEGER;
for (let j = 0; j < fibs.length; j++) {
const prev = i - fibs[j];
}
}
}
/*index = -1;
let count = 0;
while (index < N) {
let fibIndex = fibs.length - 1;
while (A[index + fibs[fibIndex]] !== 1) {
if (fibIndex === 0) return -1;
fibIndex--;
}
count++;
index += fibs[fibIndex];
}
return count;*/
}
Code: 19:50:36 UTC,
js,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
console.log(fibs);
const reachable = new Array(N).fill(0);
for (let i = 0; i < fibs.length; i++) {
if (A[i]) {
reachable[i] = 1;
}
}
console.log(reachable);
for (let i = 0; i < N; i++) {
if (A[i] && !reachable[i]) {
let minJumps = Number.MAX_SAFE_INTEGER;
for (let j = 0; j < fibs.length; j++) {
const prev = i - fibs[j];
if (reachable[prev] )
}
}
}
/*index = -1;
let count = 0;
while (index < N) {
let fibIndex = fibs.length - 1;
while (A[index + fibs[fibIndex]] !== 1) {
if (fibIndex === 0) return -1;
fibIndex--;
}
count++;
index += fibs[fibIndex];
}
return count;*/
}
Code: 19:50:59 UTC,
js,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
console.log(fibs);
const reachable = new Array(N).fill(0);
for (let i = 0; i < fibs.length; i++) {
if (A[i]) {
reachable[i] = 1;
}
}
console.log(reachable);
for (let i = 0; i < N; i++) {
if (A[i] && !reachable[i]) {
let minJumps = Number.MAX_SAFE_INTEGER;
for (let j = 0; j < fibs.length; j++) {
const prev = i - fibs[j];
if (reachable[prev] && minJumps > reachable[prev]) {
}
}
}
}
/*index = -1;
let count = 0;
while (index < N) {
let fibIndex = fibs.length - 1;
while (A[index + fibs[fibIndex]] !== 1) {
if (fibIndex === 0) return -1;
fibIndex--;
}
count++;
index += fibs[fibIndex];
}
return count;*/
}
Code: 19:51:10 UTC,
js,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
console.log(fibs);
const reachable = new Array(N).fill(0);
for (let i = 0; i < fibs.length; i++) {
if (A[i]) {
reachable[i] = 1;
}
}
console.log(reachable);
for (let i = 0; i < N; i++) {
if (A[i] && !reachable[i]) {
let minJumps = Number.MAX_SAFE_INTEGER;
for (let j = 0; j < fibs.length; j++) {
const prev = i - fibs[j];
if (reachable[prev] && minJumps > reachable[prev]) {
minJumps = reachable[prev];
}
}
}
}
/*index = -1;
let count = 0;
while (index < N) {
let fibIndex = fibs.length - 1;
while (A[index + fibs[fibIndex]] !== 1) {
if (fibIndex === 0) return -1;
fibIndex--;
}
count++;
index += fibs[fibIndex];
}
return count;*/
}
Code: 19:51:41 UTC,
js,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
console.log(fibs);
const reachable = new Array(N).fill(0);
for (let i = 0; i < fibs.length; i++) {
if (A[i]) {
reachable[i] = 1;
}
}
console.log(reachable);
for (let i = 0; i < N; i++) {
if (A[i] && !reachable[i]) {
let minJumps = Number.MAX_SAFE_INTEGER;
for (let j = 0; j < fibs.length; j++) {
const prev = i - fibs[j];
if (reachable[prev] && minJumps > reachable[prev]) {
minJumps = reachable[prev];
}
}
if (minJumps !== Nu)
}
}
/*index = -1;
let count = 0;
while (index < N) {
let fibIndex = fibs.length - 1;
while (A[index + fibs[fibIndex]] !== 1) {
if (fibIndex === 0) return -1;
fibIndex--;
}
count++;
index += fibs[fibIndex];
}
return count;*/
}
Code: 19:52:05 UTC,
js,
verify,
result: Failed
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
console.log(fibs);
const reachable = new Array(N).fill(0);
for (let i = 0; i < fibs.length; i++) {
if (A[i]) {
reachable[i] = 1;
}
}
console.log(reachable);
for (let i = 0; i < N; i++) {
if (A[i] && !reachable[i]) {
let minJumps = Number.MAX_SAFE_INTEGER;
for (let j = 0; j < fibs.length; j++) {
const prev = i - fibs[j];
if (reachable[prev] && minJumps > reachable[prev]) {
minJumps = reachable[prev];
}
}
if (minJumps !== Number.MAX_SAFE_INTEGER) {
reachable[i] = minJumps + 1;
}
}
}
console.log(reachable);
/*index = -1;
let count = 0;
while (index < N) {
let fibIndex = fibs.length - 1;
while (A[index + fibs[fibIndex]] !== 1) {
if (fibIndex === 0) return -1;
fibIndex--;
}
count++;
index += fibs[fibIndex];
}
return count;*/
}
Analysis
expand all
Example tests
1.
0.080 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, integer expected, 'undefined' found Perhaps you are missing a 'return'?stdout:
[ 1, 1, 2, 3, 5, 8 ] [ 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0 ] [ 0, 0, 0, 1, 1, 0, 2, 0, 0, 0, 0, 2 ]
Code: 19:52:16 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
console.log(fibs);
const reachable = new Array(N).fill(0);
for (let i = 0; i < fibs.length; i++) {
if (A[i]) {
reachable[i] = 1;
}
}
console.log(reachable);
for (let i = 0; i < N; i++) {
if (A[i] && !reachable[i]) {
let minJumps = Number.MAX_SAFE_INTEGER;
for (let j = 0; j < fibs.length; j++) {
const prev = i - fibs[j];
if (reachable[prev] && minJumps > reachable[prev]) {
minJumps = reachable[prev];
}
}
if (minJumps !== Number.MAX_SAFE_INTEGER) {
reachable[i] = minJumps + 1;
}
}
}
console.log(reachable);
}
Code: 19:52:40 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
console.log(fibs);
const reachable = new Array(N).fill(0);
for (let i = 0; i < fibs.length; i++) {
if (A[i]) {
reachable[i] = 1;
}
}
console.log(reachable);
for (let i = 0; i < N; i++) {
if (A[i] && !reachable[i]) {
let minJumps = Number.MAX_SAFE_INTEGER;
for (let j = 0; j < fibs.length; j++) {
const prev = i - fibs[j];
if (reachable[prev] && minJumps > reachable[prev]) {
minJumps = reachable[prev];
}
}
if (minJumps !== Number.MAX_SAFE_INTEGER) {
reachable[i] = minJumps + 1;
}
}
}
if (reachable[N]) {
return reachable[N];
} else {
return -1;
}
}
Analysis
expand all
Example tests
1.
0.076 s
WRONG ANSWER,
got -1 expected 3
stdout:
[ 1, 1, 2, 3, 5, 8 ] [ 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0 ]
Code: 19:52:52 UTC,
js,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
console.log(fibs);
const reachable = new Array(N).fill(0);
for (let i = 0; i < fibs.length; i++) {
if (A[i]) {
reachable[i] = 1;
}
}
console.log(reachable);
for (let i = 0; i < N; i++) {
if (A[i] && !reachable[i]) {
let minJumps = Number.MAX_SAFE_INTEGER;
for (let j = 0; j < fibs.length; j++) {
const prev = i - fibs[j];
if (reachable[prev] && minJumps > reachable[prev]) {
minJumps = reachable[prev];
}
}
if (minJumps !== Number.MAX_SAFE_INTEGER) {
reachable[i] = minJumps + 1;
}
}
}
if (reachable[N]) {
return reachable[N];
} else {
return -1;
}
}
Code: 19:53:02 UTC,
js,
verify,
result: Failed
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
console.log(fibs);
const reachable = new Array(N).fill(0);
for (let i = 0; i < fibs.length; i++) {
if (A[i]) {
reachable[i] = 1;
}
}
console.log(reachable);
for (let i = 0; i < N; i++) {
if (A[i] && !reachable[i]) {
let minJumps = Number.MAX_SAFE_INTEGER;
for (let j = 0; j < fibs.length; j++) {
const prev = i - fibs[j];
if (reachable[prev] && minJumps > reachable[prev]) {
minJumps = reachable[prev];
}
}
if (minJumps !== Number.MAX_SAFE_INTEGER) {
reachable[i] = minJumps + 1;
}
}
}
console.log(reachable);
if (reachable[N - 1]) {
return reachable[N];
} else {
return -1;
}
}
Analysis
expand all
Example tests
1.
0.076 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, integer expected, 'undefined' found Perhaps you are missing a 'return'?stdout:
[ 1, 1, 2, 3, 5, 8 ] [ 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0 ] [ 0, 0, 0, 1, 1, 0, 2, 0, 0, 0, 0, 2 ]
Code: 19:53:12 UTC,
js,
verify,
result: Failed
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
console.log(fibs);
const reachable = new Array(N).fill(0);
for (let i = 0; i < fibs.length; i++) {
if (A[i]) {
reachable[i] = 1;
}
}
console.log(reachable);
for (let i = 0; i < N; i++) {
if (A[i] && !reachable[i]) {
let minJumps = Number.MAX_SAFE_INTEGER;
for (let j = 0; j < fibs.length; j++) {
const prev = i - fibs[j];
if (reachable[prev] && minJumps > reachable[prev]) {
minJumps = reachable[prev];
}
}
if (minJumps !== Number.MAX_SAFE_INTEGER) {
reachable[i] = minJumps + 1;
}
}
}
console.log(reachable);
if (reachable[N - 1]) {
return reachable[N - 1];
} else {
return -1;
}
}
Analysis
expand all
Example tests
1.
0.076 s
WRONG ANSWER,
got 2 expected 3
stdout:
[ 1, 1, 2, 3, 5, 8 ] [ 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0 ] [ 0, 0, 0, 1, 1, 0, 2, 0, 0, 0, 0, 2 ]
Code: 19:53:27 UTC,
js,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
console.
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
console.log(fibs);
const reachable = new Array(N).fill(0);
for (let i = 0; i < fibs.length; i++) {
if (A[i]) {
reachable[i] = 1;
}
}
console.log(reachable);
for (let i = 0; i < N; i++) {
if (A[i] && !reachable[i]) {
let minJumps = Number.MAX_SAFE_INTEGER;
for (let j = 0; j < fibs.length; j++) {
const prev = i - fibs[j];
if (reachable[prev] && minJumps > reachable[prev]) {
minJumps = reachable[prev];
}
}
if (minJumps !== Number.MAX_SAFE_INTEGER) {
reachable[i] = minJumps + 1;
}
}
}
console.log(reachable);
if (reachable[N - 1]) {
return reachable[N - 1];
} else {
return -1;
}
}
Code: 19:53:29 UTC,
js,
verify,
result: Failed
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
console.log(A);
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
console.log(fibs);
const reachable = new Array(N).fill(0);
for (let i = 0; i < fibs.length; i++) {
if (A[i]) {
reachable[i] = 1;
}
}
console.log(reachable);
for (let i = 0; i < N; i++) {
if (A[i] && !reachable[i]) {
let minJumps = Number.MAX_SAFE_INTEGER;
for (let j = 0; j < fibs.length; j++) {
const prev = i - fibs[j];
if (reachable[prev] && minJumps > reachable[prev]) {
minJumps = reachable[prev];
}
}
if (minJumps !== Number.MAX_SAFE_INTEGER) {
reachable[i] = minJumps + 1;
}
}
}
console.log(reachable);
if (reachable[N - 1]) {
return reachable[N - 1];
} else {
return -1;
}
}
Analysis
expand all
Example tests
1.
0.076 s
WRONG ANSWER,
got 2 expected 3
stdout:
[ 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1 ] [ 1, 1, 2, 3, 5, 8 ] [ 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0 ] [ 0, 0, 0, 1, 1, 0, 2, 0, 0, 0, 0, 2 ]
Code: 19:57:29 UTC,
js,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
console.log(A);
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
console.log(fibs);
const reachable = new Array(N).fill(0);
for (let i = 0; i < fibs.length; i++) {
if (A[fib]) {
reachable[i] = 1;
}
}
console.log(reachable);
for (let i = 0; i < N; i++) {
if (A[i] && !reachable[i]) {
let minJumps = Number.MAX_SAFE_INTEGER;
for (let j = 0; j < fibs.length; j++) {
const prev = i - fibs[j];
if (reachable[prev] && minJumps > reachable[prev]) {
minJumps = reachable[prev];
}
}
if (minJumps !== Number.MAX_SAFE_INTEGER) {
reachable[i] = minJumps + 1;
}
}
}
console.log(reachable);
if (reachable[N - 1]) {
return reachable[N - 1];
} else {
return -1;
}
}
Code: 19:57:47 UTC,
js,
verify,
result: Failed
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
console.log(A);
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
console.log(fibs);
const reachable = new Array(N).fill(0);
for (let i = 0; i < fibs.length; i++) {
if (A[fibs[i]]) {
reachable[fibs[i]] = 1;
}
}
console.log(reachable);
for (let i = 0; i < N; i++) {
if (A[i] && !reachable[i]) {
let minJumps = Number.MAX_SAFE_INTEGER;
for (let j = 0; j < fibs.length; j++) {
const prev = i - fibs[j];
if (reachable[prev] && minJumps > reachable[prev]) {
minJumps = reachable[prev];
}
}
if (minJumps !== Number.MAX_SAFE_INTEGER) {
reachable[i] = minJumps + 1;
}
}
}
console.log(reachable);
if (reachable[N - 1]) {
return reachable[N - 1];
} else {
return -1;
}
}
Analysis
expand all
Example tests
1.
0.080 s
WRONG ANSWER,
got 2 expected 3
stdout:
[ 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1 ] [ 1, 1, 2, 3, 5, 8 ] [ 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0 ] [ 0, 0, 0, 1, 2, 0, 2, 0, 0, 0, 0, 2 ]
Code: 19:58:56 UTC,
js,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
console.log(A);
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
console.log(fibs);
const reachable = new Array(N).fill(0);
for (let i = 0; i < fibs.length; i++) {
if (A[fibs[i] ]) {
reachable[fibs[i]] = 1;
}
}
console.log(reachable);
for (let i = 0; i < N; i++) {
if (A[i] && !reachable[i]) {
let minJumps = Number.MAX_SAFE_INTEGER;
for (let j = 0; j < fibs.length; j++) {
const prev = i - fibs[j];
if (reachable[prev] && minJumps > reachable[prev]) {
minJumps = reachable[prev];
}
}
if (minJumps !== Number.MAX_SAFE_INTEGER) {
reachable[i] = minJumps + 1;
}
}
}
console.log(reachable);
if (reachable[N - 1]) {
return reachable[N - 1];
} else {
return -1;
}
}
Code: 19:58:59 UTC,
js,
verify,
result: Passed
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
console.log(A);
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
console.log(fibs);
const reachable = new Array(N).fill(0);
for (let i = 0; i < fibs.length; i++) {
if (A[fibs[i] - 1]) {
reachable[fibs[i] - 1] = 1;
}
}
console.log(reachable);
for (let i = 0; i < N; i++) {
if (A[i] && !reachable[i]) {
let minJumps = Number.MAX_SAFE_INTEGER;
for (let j = 0; j < fibs.length; j++) {
const prev = i - fibs[j];
if (reachable[prev] && minJumps > reachable[prev]) {
minJumps = reachable[prev];
}
}
if (minJumps !== Number.MAX_SAFE_INTEGER) {
reachable[i] = minJumps + 1;
}
}
}
console.log(reachable);
if (reachable[N - 1]) {
return reachable[N - 1];
} else {
return -1;
}
}
Analysis
expand all
Example tests
1.
0.076 s
OK
stdout:
[ 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1 ] [ 1, 1, 2, 3, 5, 8 ] [ 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0 ] [ 0, 0, 0, 0, 1, 0, 2, 0, 0, 0, 0, 3 ]
Code: 19:59:34 UTC,
js,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
console.log(A);
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
console.log(fibs);
const reachable = new Array(N).fill(0);
for (let i = 0; i < fibs.length; i++) {
if (A[fibs[i] - 1]) {
reachable[fibs[i] - 1] = 1;
}
}
console.log(reachable);
for (let i = 0; i < N; i++) {
if (A[i] && !reachable[i]) {
let minJumps = Number.MAX_SAFE_INTEGER;
for (let j = 0; j < fibs.length; j++) {
const prev = i - fibs[j];
if (reachable[prev] && minJumps > reachable[prev]) {
minJumps = reachable[prev];
}
}
if (minJumps !== Number.MAX_SAFE_INTEGER) {
reachable[i] = minJumps + 1;
}
}
}
console.log(reachable);
if (reachable[N - 1]) {
return reachable[N - 1];
} else {
return -1;
}
}
Code: 19:59:34 UTC,
js,
verify,
result: Passed
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
console.log(A);
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
console.log(fibs);
const reachable = new Array(N).fill(0);
for (let i = 0; i < fibs.length; i++) {
if (A[fibs[i] - 1]) {
reachable[fibs[i] - 1] = 1;
}
}
console.log(reachable);
for (let i = 0; i < N; i++) {
if (A[i] && !reachable[i]) {
let minJumps = Number.MAX_SAFE_INTEGER;
for (let j = 0; j < fibs.length; j++) {
const prev = i - fibs[j];
if (reachable[prev] && minJumps > reachable[prev]) {
minJumps = reachable[prev];
}
}
if (minJumps !== Number.MAX_SAFE_INTEGER) {
reachable[i] = minJumps + 1;
}
}
}
console.log(reachable);
if (reachable[N - 1]) {
return reachable[N - 1];
} else {
return -1;
}
}
User test case 1:
[1, 1, 0, 0, 0]
Analysis
expand all
Example tests
1.
0.076 s
OK
stdout:
[ 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1 ] [ 1, 1, 2, 3, 5, 8 ] [ 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0 ] [ 0, 0, 0, 0, 1, 0, 2, 0, 0, 0, 0, 3 ]
expand all
User tests
1.
0.076 s
OK
function result: 2
function result: 2
stdout:
[ 1, 1, 0, 0, 0, 1 ] [ 1, 1, 2, 3, 5 ] [ 1, 1, 0, 0, 0, 0 ] [ 1, 1, 0, 0, 0, 2 ]
Code: 19:59:55 UTC,
js,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
console.log(fibs);
const reachable = new Array(N).fill(0);
for (let i = 0; i < fibs.length; i++) {
if (A[fibs[i] - 1]) {
reachable[fibs[i] - 1] = 1;
}
}
console.log(reachable);
for (let i = 0; i < N; i++) {
if (A[i] && !reachable[i]) {
let minJumps = Number.MAX_SAFE_INTEGER;
for (let j = 0; j < fibs.length; j++) {
const prev = i - fibs[j];
if (reachable[prev] && minJumps > reachable[prev]) {
minJumps = reachable[prev];
}
}
if (minJumps !== Number.MAX_SAFE_INTEGER) {
reachable[i] = minJumps + 1;
}
}
}
console.log(reachable);
if (reachable[N - 1]) {
return reachable[N - 1];
} else {
return -1;
}
}
Code: 20:00:08 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
const reachable = new Array(N).fill(0);
for (let i = 0; i < fibs.length; i++) {
if (A[fibs[i] - 1]) {
reachable[fibs[i] - 1] = 1;
}
}
console.log(reachable);
for (let i = 0; i < N; i++) {
if (A[i] && !reachable[i]) {
let minJumps = Number.MAX_SAFE_INTEGER;
for (let j = 0; j < fibs.length; j++) {
const prev = i - fibs[j];
if (reachable[prev] && minJumps > reachable[prev]) {
minJumps = reachable[prev];
}
}
if (minJumps !== Number.MAX_SAFE_INTEGER) {
reachable[i] = minJumps + 1;
}
}
}
console.log(reachable);
if (reachable[N - 1]) {
return reachable[N - 1];
} else {
return -1;
}
}
Code: 20:00:18 UTC,
js,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
// calculate fibonacci numbers until N
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
const reachable = new Array(N).fill(0);
for (let i = 0; i < fibs.length; i++) {
if (A[fibs[i] - 1]) {
reachable[fibs[i] - 1] = 1;
}
}
console.log(reachable);
for (let i = 0; i < N; i++) {
if (A[i] && !reachable[i]) {
let minJumps = Number.MAX_SAFE_INTEGER;
for (let j = 0; j < fibs.length; j++) {
const prev = i - fibs[j];
if (reachable[prev] && minJumps > reachable[prev]) {
minJumps = reachable[prev];
}
}
if (minJumps !== Number.MAX_SAFE_INTEGER) {
reachable[i] = minJumps + 1;
}
}
}
console.log(reachable);
if (reachable[N - 1]) {
return reachable[N - 1];
} else {
return -1;
}
}
Code: 20:00:48 UTC,
js,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
// calculate Fibonacci numbers until N
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
const reachable = new Array(N).fill(0);
for (let i = 0; i < fibs.length; i++) {
if (A[fibs[i] - 1]) {
reachable[fibs[i] - 1] = 1;
}
}
console.log(reachable);
for (let i = 0; i < N; i++) {
if (A[i] && !reachable[i]) {
let minJumps = Number.MAX_SAFE_INTEGER;
for (let j = 0; j < fibs.length; j++) {
const prev = i - fibs[j];
if (reachable[prev] && minJumps > reachable[prev]) {
minJumps = reachable[prev];
}
}
if (minJumps !== Number.MAX_SAFE_INTEGER) {
reachable[i] = minJumps + 1;
}
}
}
console.log(reachable);
if (reachable[N - 1]) {
return reachable[N - 1];
} else {
return -1;
}
}
Code: 20:01:00 UTC,
js,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
// calculate Fibonacci numbers until N
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
// reachable
const reachable = new Array(N).fill(0);
for (let i = 0; i < fibs.length; i++) {
if (A[fibs[i] - 1]) {
reachable[fibs[i] - 1] = 1;
}
}
console.log(reachable);
for (let i = 0; i < N; i++) {
if (A[i] && !reachable[i]) {
let minJumps = Number.MAX_SAFE_INTEGER;
for (let j = 0; j < fibs.length; j++) {
const prev = i - fibs[j];
if (reachable[prev] && minJumps > reachable[prev]) {
minJumps = reachable[prev];
}
}
if (minJumps !== Number.MAX_SAFE_INTEGER) {
reachable[i] = minJumps + 1;
}
}
}
console.log(reachable);
if (reachable[N - 1]) {
return reachable[N - 1];
} else {
return -1;
}
}
Code: 20:01:24 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
// calculate Fibonacci numbers until N
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
// reachable leaves from starting point
const reachable = new Array(N).fill(0);
for (let i = 0; i < fibs.length; i++) {
if (A[fibs[i] - 1]) {
reachable[fibs[i] - 1] = 1;
}
}
for (let i = 0; i < N; i++) {
if (A[i] && !reachable[i]) {
let minJumps = Number.MAX_SAFE_INTEGER;
for (let j = 0; j < fibs.length; j++) {
const prev = i - fibs[j];
if (reachable[prev] && minJumps > reachable[prev]) {
minJumps = reachable[prev];
}
}
if (minJumps !== Number.MAX_SAFE_INTEGER) {
reachable[i] = minJumps + 1;
}
}
}
if (reachable[N - 1]) {
return reachable[N - 1];
} else {
return -1;
}
}
Code: 20:01:43 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
// calculate Fibonacci numbers until N
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
// reachable leaves from starting point
const reachable = new Array(N).fill(0);
for (let i = 0; i < fibs.length; i++) {
if (A[fibs[i] - 1]) {
reachable[fibs[i] - 1] = 1;
}
}
for (let i = 0; i < N; i++) {
if (A[i] && !reachable[i]) {
// get the minimal jump count to
let minJumps = Number.MAX_SAFE_INTEGER;
for (let j = 0; j < fibs.length; j++) {
const prev = i - fibs[j];
if (reachable[prev] && minJumps > reachable[prev]) {
minJumps = reachable[prev];
}
}
if (minJumps !== Number.MAX_SAFE_INTEGER) {
reachable[i] = minJumps + 1;
}
}
}
if (reachable[N - 1]) {
return reachable[N - 1];
} else {
return -1;
}
}
Code: 20:01:53 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
// calculate Fibonacci numbers until N
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
// reachable leaves from starting point
const reachable = new Array(N).fill(0);
for (let i = 0; i < fibs.length; i++) {
if (A[fibs[i] - 1]) {
reachable[fibs[i] - 1] = 1;
}
}
for (let i = 0; i < N; i++) {
if (A[i] && !reachable[i]) {
// get the minimal jump count to reach this leaf
let minJumps = Number.MAX_SAFE_INTEGER;
for (let j = 0; j < fibs.length; j++) {
const prev = i - fibs[j];
if (reachable[prev] && minJumps > reachable[prev]) {
minJumps = reachable[prev];
}
}
if (minJumps !== Number.MAX_SAFE_INTEGER) {
reachable[i] = minJumps + 1;
}
}
}
if (reachable[N - 1]) {
return reachable[N - 1];
} else {
return -1;
}
}
Code: 20:01:54 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
// calculate Fibonacci numbers until N
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
// reachable leaves from starting point
const reachable = new Array(N).fill(0);
for (let i = 0; i < fibs.length; i++) {
if (A[fibs[i] - 1]) {
reachable[fibs[i] - 1] = 1;
}
}
for (let i = 0; i < N; i++) {
if (A[i] && !reachable[i]) {
// get the minimal jump count to reach this leaf
let minJumps = Number.MAX_SAFE_INTEGER;
for (let j = 0; j < fibs.length; j++) {
const prev = i - fibs[j];
if (reachable[prev] && minJumps > reachable[prev]) {
minJumps = reachable[prev];
}
}
if (minJumps !== Number.MAX_SAFE_INTEGER) {
reachable[i] = minJumps + 1;
}
}
}
if (reachable[N - 1]) {
return reachable[N - 1];
} else {
return -1;
}
}
User test case 1:
[1, 1, 0, 0, 0]
Analysis
Code: 20:01:59 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
// calculate Fibonacci numbers until N
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
// reachable leaves from starting point
const reachable = new Array(N).fill(0);
for (let i = 0; i < fibs.length; i++) {
if (A[fibs[i] - 1]) {
reachable[fibs[i] - 1] = 1;
}
}
for (let i = 0; i < N; i++) {
if (A[i] && !reachable[i]) {
// get the minimal jump count to reach this leaf
let minJumps = Number.MAX_SAFE_INTEGER;
for (let j = 0; j < fibs.length; j++) {
const prev = i - fibs[j];
if (reachable[prev] && minJumps > reachable[prev]) {
minJumps = reachable[prev];
}
}
if (minJumps !== Number.MAX_SAFE_INTEGER) {
reachable[i] = minJumps + 1;
}
}
}
if (reachable[N - 1]) {
return reachable[N - 1];
} else {
return -1;
}
}
User test case 1:
[1, 1, 0, 0, 0]
Analysis
Code: 20:02:01 UTC,
js,
final,
score:
100
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// it is valid to step on the other shore
A.push(1);
// calculate Fibonacci numbers until N
const N = A.length;
const fibs = [1, 1];
let index = 2;
while (true) {
const nextFib = fibs[index - 1] + fibs[index - 2];
if (nextFib > N) break;
fibs.push(nextFib);
index++;
}
// reachable leaves from starting point
const reachable = new Array(N).fill(0);
for (let i = 0; i < fibs.length; i++) {
if (A[fibs[i] - 1]) {
reachable[fibs[i] - 1] = 1;
}
}
for (let i = 0; i < N; i++) {
if (A[i] && !reachable[i]) {
// get the minimal jump count to reach this leaf
let minJumps = Number.MAX_SAFE_INTEGER;
for (let j = 0; j < fibs.length; j++) {
const prev = i - fibs[j];
if (reachable[prev] && minJumps > reachable[prev]) {
minJumps = reachable[prev];
}
}
if (minJumps !== Number.MAX_SAFE_INTEGER) {
reachable[i] = minJumps + 1;
}
}
}
if (reachable[N - 1]) {
return reachable[N - 1];
} else {
return -1;
}
}Analysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(N * log(N))
expand all
Correctness tests
1.
0.072 s
OK
2.
0.072 s
OK
3.
0.072 s
OK
4.
0.076 s
OK
1.
0.076 s
OK
2.
0.072 s
OK
3.
0.072 s
OK
1.
0.072 s
OK
2.
0.072 s
OK
3.
0.072 s
OK
4.
0.072 s
OK
5.
0.072 s
OK
6.
0.072 s
OK
7.
0.072 s
OK
8.
0.072 s
OK
1.
0.072 s
OK
1.
0.072 s
OK
2.
0.076 s
OK
3.
0.072 s
OK
4.
0.072 s
OK
1.
0.072 s
OK
expand all
Performance tests
1.
0.084 s
OK
1.
0.092 s
OK
1.
0.108 s
OK
2.
0.104 s
OK
3.
0.104 s
OK
1.
0.172 s
OK
2.
0.116 s
OK
1.
0.176 s
OK
1.
0.104 s
OK
2.
0.240 s
OK