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 18 minutes
Notes
not defined yet
Code: 09:20:24 UTC,
java,
autosave
Code: 09:21:26 UTC,
js,
autosave
Code: 09:21:39 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 1;
}
let fib = [0, 1];
let steps = [1, 0];
let N = A.length + 1;
for (let i = 2; i < A.length)
}
Code: 09:21:52 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 1;
}
let fib = [0, 1];
let steps = [1, 0];
let N = A.length + 1;
for (let i = 2; i < N; i++) {
}
}
Code: 09:22:23 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 1;
}
let fib = [0, 1];
let steps = [1, 0];
let N = A.length + 1;
for (let i = 2; i < N; i++) {
fib[i] = fib[i-1] + fib[i-2];
steps[i] = 0;
if (fib)
}
}
Code: 09:22:40 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 1;
}
let fib = [0, 1];
let steps = [1, 0];
let N = A.length + 1;
for (let i = 2; i < N; i++) {
fib[i] = fib[i-1] + fib[i-2];
steps[i] = 0;
if (fib[i] === N) {
return 1;
}
}
}
Code: 09:22:55 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 1;
}
let fib = [0, 1];
let steps = [1, 0];
let N = A.length + 1;
for (let i = 2; i < N; i++) {
fib[i] = fib[i-1] + fib[i-2];
steps[i] = 0;
if (fib[i] === N) {
return 1;
}
}
let base = 0;
}
Code: 09:23:08 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 1;
}
let fib = [0, 1];
let steps = [1, 0];
let N = A.length + 1;
for (let i = 2; i < N; i++) {
fib[i] = fib[i-1] + fib[i-2];
steps[i] = 0;
if (fib[i] === N) {
return 1;
}
}
let base = 0;
let result = -1;
}
Code: 09:23:18 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 1;
}
let fib = [0, 1];
let steps = [1, 0];
let N = A.length + 1;
for (let i = 2; i < N; i++) {
fib[i] = fib[i-1] + fib[i-2];
steps[i] = 0;
if (fib[i] === N) {
return 1;
}
}
let base = 0;
let result = -1;
let i = 2;
}
Code: 09:23:43 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 1;
}
let fib = [0, 1];
let steps = [1, 0];
let N = A.length + 1;
for (let i = 2; i < N; i++) {
fib[i] = fib[i-1] + fib[i-2];
steps[i] = 0;
if (fib[i] === N) {
return 1;
}
}
let base = 0;
let result = -1;
let i = 2;
while (i < fib.length && base )
}
Code: 09:24:10 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 1;
}
let fib = [0, 1];
let steps = [1, 0];
let N = A.length + 1;
for (let i = 2; i < N; i++) {
fib[i] = fib[i-1] + fib[i-2];
steps[i] = 0;
if (fib[i] === N) {
return 1;
}
}
let base = 0;
let result = -1;
let i = 2;
while (i < fib.length && base <= N) {
let nextPos = base + fib[i];
}
}
Code: 09:24:20 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 1;
}
let fib = [0, 1];
let steps = [1, 0];
let N = A.length + 1;
for (let i = 2; i < N; i++) {
fib[i] = fib[i-1] + fib[i-2];
steps[i] = 0;
if (fib[i] === N) {
return 1;
}
}
let base = 0;
let result = -1;
let i = 2;
while (i < fib.length && base <= N) {
let nextPos = base + fib[i];
if
}
}
Code: 09:24:39 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 1;
}
let fib = [0, 1];
let steps = [1, 0];
let N = A.length + 1;
for (let i = 2; i < N; i++) {
fib[i] = fib[i-1] + fib[i-2];
steps[i] = 0;
if (fib[i] === N) {
return 1;
}
}
let base = 0;
let result = -1;
let i = 2;
while (i < fib.length && base <= N) {
let nextPos = base + fib[i];
if (steps[base] === 0) {
}
}
}
Code: 09:25:09 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 1;
}
let fib = [0, 1];
let steps = [1, 0];
let N = A.length + 1;
for (let i = 2; i < N; i++) {
fib[i] = fib[i-1] + fib[i-2];
steps[i] = 0;
if (fib[i] === N) {
return 1;
}
}
let base = 0;
let result = -1;
let i = 2;
while (i < fib.length && base <= N) {
let nextPos = base + fib[i];
if (steps[base] === 0) {
base++;
} else if (nextPos > A.length + 1) {
}
}
}
Code: 09:25:39 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 1;
}
let fib = [0, 1];
let steps = [1, 0];
let N = A.length + 1;
for (let i = 2; i < N; i++) {
fib[i] = fib[i-1] + fib[i-2];
steps[i] = 0;
if (fib[i] === N) {
return 1;
}
}
let base = 0;
let result = -1;
let i = 2;
while (i < fib.length && base <= N) {
let nextPos = base + fib[i];
if (steps[base] === 0) {
base++;
} else if (nextPos > A.length + 1) {
base++;
i = 2;
} else {
if (nextPos === A.length)
}
}
}
Code: 09:25:49 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 1;
}
let fib = [0, 1];
let steps = [1, 0];
let N = A.length + 1;
for (let i = 2; i < N; i++) {
fib[i] = fib[i-1] + fib[i-2];
steps[i] = 0;
if (fib[i] === N) {
return 1;
}
}
let base = 0;
let result = -1;
let i = 2;
while (i < fib.length && base <= N) {
let nextPos = base + fib[i];
if (steps[base] === 0) {
base++;
} else if (nextPos > N) {
base++;
i = 2;
} else {
if (nextPos === N)
}
}
}
Code: 09:26:19 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 1;
}
let fib = [0, 1];
let steps = [1, 0];
let N = A.length + 1;
for (let i = 2; i < N; i++) {
fib[i] = fib[i-1] + fib[i-2];
steps[i] = 0;
if (fib[i] === N) {
return 1;
}
}
let base = 0;
let result = -1;
let i = 2;
while (i < fib.length && base <= N) {
let nextPos = base + fib[i];
if (steps[base] === 0) {
base++;
} else if (nextPos > N) {
base++;
i = 2;
} else {
if (nextPos === N) {
if (base === 0) {
return 1;
} else if (result < 0)
}
}
}
}
Code: 09:26:29 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 1;
}
let fib = [0, 1];
let steps = [1, 0];
let N = A.length + 1;
for (let i = 2; i < N; i++) {
fib[i] = fib[i-1] + fib[i-2];
steps[i] = 0;
if (fib[i] === N) {
return 1;
}
}
let base = 0;
let result = -1;
let i = 2;
while (i < fib.length && base <= N) {
let nextPos = base + fib[i];
if (steps[base] === 0) {
base++;
} else if (nextPos > N) {
base++;
i = 2;
} else {
if (nextPos === N) {
if (base === 0) {
return 1;
} else if (result < 0) {
return
}
}
}
}
}
Code: 09:26:58 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 1;
}
let fib = [0, 1];
let steps = [1, 0];
let N = A.length + 1;
for (let i = 2; i < N; i++) {
fib[i] = fib[i-1] + fib[i-2];
steps[i] = 0;
if (fib[i] === N) {
return 1;
}
}
let base = 0;
let result = -1;
let i = 2;
while (i < fib.length && base <= N) {
let nextPos = base + fib[i];
if (steps[base] === 0) {
base++;
} else if (nextPos > N) {
base++;
i = 2;
} else {
if (nextPos === N) {
if (base === 0) {
return 1;
} else if (result < 0) {
result = steps[base] + 1;
} else {
result = Math
}
}
}
}
}
Code: 09:27:25 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 1;
}
let fib = [0, 1];
let steps = [1, 0];
let N = A.length + 1;
for (let i = 2; i < N; i++) {
fib[i] = fib[i-1] + fib[i-2];
steps[i] = 0;
if (fib[i] === N) {
return 1;
}
}
let base = 0;
let result = -1;
let i = 2;
while (i < fib.length && base <= N) {
let nextPos = base + fib[i];
if (steps[base] === 0) {
base++;
} else if (nextPos > N) {
base++;
i = 2;
} else {
if (nextPos === N) {
if (base === 0) {
return 1;
} else if (result < 0) {
result = steps[base] + 1;
} else {
result = Math
}
}
}
}
}
Code: 09:27:55 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 1;
}
let fib = [0, 1];
let steps = [1, 0];
let N = A.length + 1;
for (let i = 2; i < N; i++) {
fib[i] = fib[i-1] + fib[i-2];
steps[i] = 0;
if (fib[i] === N) {
return 1;
}
}
let base = 0;
let result = -1;
let i = 2;
while (i < fib.length && base <= N) {
let nextPos = base + fib[i];
if (steps[base] === 0) {
base++;
} else if (nextPos > N) {
base++;
i = 2;
} else {
if (nextPos === N) {
if (base === 0) {
return 1;
} else if (result < 0) {
result = steps[base] + 1;
} else {
result = Math.min(result, steps[base] + 1);
}
}
}
}
}
Code: 09:28:26 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 1;
}
let fib = [0, 1];
let steps = [1, 0];
let N = A.length + 1;
for (let i = 2; i < N; i++) {
fib[i] = fib[i-1] + fib[i-2];
steps[i] = 0;
if (fib[i] === N) {
return 1;
}
}
let base = 0;
let result = -1;
let i = 2;
while (i < fib.length && base <= N) {
let nextPos = base + fib[i];
if (steps[base] === 0) {
base++;
} else if (nextPos > N) {
base++;
i = 2;
} else {
if (nextPos === N) {
if (base === 0) {
return 1;
} else if (result < 0) {
result = steps[base] + 1;
} else {
result = Math.min(result, steps[base] + 1);
}
} else if (A[nextPos-1] === 1) {
if(steps[nextPos] ===)
}
}
}
}
Code: 09:28:56 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 1;
}
let fib = [0, 1];
let steps = [1, 0];
let N = A.length + 1;
for (let i = 2; i < N; i++) {
fib[i] = fib[i-1] + fib[i-2];
steps[i] = 0;
if (fib[i] === N) {
return 1;
}
}
let base = 0;
let result = -1;
let i = 2;
while (i < fib.length && base <= N) {
let nextPos = base + fib[i];
if (steps[base] === 0) {
base++;
} else if (nextPos > N) {
base++;
i = 2;
} else {
if (nextPos === N) {
if (base === 0) {
return 1;
} else if (result < 0) {
result = steps[base] + 1;
} else {
result = Math.min(result, steps[base] + 1);
}
} else if (A[nextPos-1] === 1) {
if(steps[nextPos] === 0) {
if (base === 0) {
steps[nextPos] = 1;
} else {
stes
}
}
}
}
}
}
Code: 09:29:17 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 1;
}
let fib = [0, 1];
let steps = [1, 0];
let N = A.length + 1;
for (let i = 2; i < N; i++) {
fib[i] = fib[i-1] + fib[i-2];
steps[i] = 0;
if (fib[i] === N) {
return 1;
}
}
let base = 0;
let result = -1;
let i = 2;
while (i < fib.length && base <= N) {
let nextPos = base + fib[i];
if (steps[base] === 0) {
base++;
} else if (nextPos > N) {
base++;
i = 2;
} else {
if (nextPos === N) {
if (base === 0) {
return 1;
} else if (result < 0) {
result = steps[base] + 1;
} else {
result = Math.min(result, steps[base] + 1);
}
} else if (A[nextPos-1] === 1) {
if(steps[nextPos] === 0) {
if (base === 0) {
steps[nextPos] = 1;
} else {
steps[nextPos] = steps[base] + 1;
}
}
}
}
}
}
Code: 09:29:47 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 1;
}
let fib = [0, 1];
let steps = [1, 0];
let N = A.length + 1;
for (let i = 2; i < N; i++) {
fib[i] = fib[i-1] + fib[i-2];
steps[i] = 0;
if (fib[i] === N) {
return 1;
}
}
let base = 0;
let result = -1;
let i = 2;
while (i < fib.length && base <= N) {
let nextPos = base + fib[i];
if (steps[base] === 0) {
base++;
} else if (nextPos > N) {
base++;
i = 2;
} else {
if (nextPos === N) {
if (base === 0) {
return 1;
} else if (result < 0) {
result = steps[base] + 1;
} else {
result = Math.min(result, steps[base] + 1);
}
} else if (A[nextPos-1] === 1) {
if(steps[nextPos] === 0) {
if (base === 0) {
steps[nextPos] = 1;
} else {
steps[nextPos] = steps[base] + 1;
}
} else {
steps[next]
}
}
}
}
}
Code: 09:29:58 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 1;
}
let fib = [0, 1];
let steps = [1, 0];
let N = A.length + 1;
for (let i = 2; i < N; i++) {
fib[i] = fib[i-1] + fib[i-2];
steps[i] = 0;
if (fib[i] === N) {
return 1;
}
}
let base = 0;
let result = -1;
let i = 2;
while (i < fib.length && base <= N) {
let nextPos = base + fib[i];
if (steps[base] === 0) {
base++;
} else if (nextPos > N) {
base++;
i = 2;
} else {
if (nextPos === N) {
if (base === 0) {
return 1;
} else if (result < 0) {
result = steps[base] + 1;
} else {
result = Math.min(result, steps[base] + 1);
}
} else if (A[nextPos-1] === 1) {
if(steps[nextPos] === 0) {
if (base === 0) {
steps[nextPos] = 1;
} else {
steps[nextPos] = steps[base] + 1;
}
} else {
steps[nextPos] =
}
}
}
}
}
Code: 09:30:27 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 1;
}
let fib = [0, 1];
let steps = [1, 0];
let N = A.length + 1;
for (let i = 2; i < N; i++) {
fib[i] = fib[i-1] + fib[i-2];
steps[i] = 0;
if (fib[i] === N) {
return 1;
}
}
let base = 0;
let result = -1;
let i = 2;
while (i < fib.length && base <= N) {
let nextPos = base + fib[i];
if (steps[base] === 0) {
base++;
} else if (nextPos > N) {
base++;
i = 2;
} else {
if (nextPos === N) {
if (base === 0) {
return 1;
} else if (result < 0) {
result = steps[base] + 1;
} else {
result = Math.min(result, steps[base] + 1);
}
} else if (A[nextPos-1] === 1) {
if(steps[nextPos] === 0) {
if (base === 0) {
steps[nextPos] = 1;
} else {
steps[nextPos] = steps[base] + 1;
}
} else {
steps[nextPos] = Math.min(steps[nextPos], steps[base] + 1)
}
}
}
}
}
Code: 09:30:57 UTC,
js,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 1;
}
let fib = [0, 1];
let steps = [1, 0];
let N = A.length + 1;
for (let i = 2; i < N; i++) {
fib[i] = fib[i-1] + fib[i-2];
steps[i] = 0;
if (fib[i] === N) {
return 1;
}
}
let base = 0;
let result = -1;
let i = 2;
while (i < fib.length && base <= N) {
let nextPos = base + fib[i];
if (steps[base] === 0) {
base++;
} else if (nextPos > N) {
base++;
i = 2;
} else {
if (nextPos === N) {
if (base === 0) {
return 1;
} else if (result < 0) {
result = steps[base] + 1;
} else {
result = Math.min(result, steps[base] + 1);
}
} else if (A[nextPos-1] === 1) {
if(steps[nextPos] === 0) {
if (base === 0) {
steps[nextPos] = 1;
} else {
steps[nextPos] = steps[base] + 1;
}
} else {
steps[nextPos] = Math.min(steps[nextPos], steps[base] + 1)
}
}
i++;
}
}
}
Code: 09:31:26 UTC,
js,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 1;
}
let fib = [0, 1];
let steps = [1, 0];
let N = A.length + 1;
for (let i = 2; i < N; i++) {
fib[i] = fib[i-1] + fib[i-2];
steps[i] = 0;
if (fib[i] === N) {
return 1;
}
}
let base = 0;
let result = -1;
let i = 2;
while (i < fib.length && base <= N) {
let nextPos = base + fib[i];
if (steps[base] === 0) {
base++;
} else if (nextPos > N) {
base++;
i = 2;
} else {
if (nextPos === N) {
if (base === 0) {
return 1;
} else if (result < 0) {
result = steps[base] + 1;
} else {
result = Math.min(result, steps[base] + 1);
}
} else if (A[nextPos-1] === 1) {
if(steps[nextPos] === 0) {
if (base === 0) {
steps[nextPos] = 1;
} else {
steps[nextPos] = steps[base] + 1;
}
} else {
steps[nextPos] = Math.min(steps[nextPos], steps[base] + 1)
}
if (i+1 >= fib.length) {
base++;
i = 2;
}
}
i++;
}
}
}
Code: 09:31:37 UTC,
js,
verify,
result: Passed
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 1;
}
let fib = [0, 1];
let steps = [1, 0];
let N = A.length + 1;
for (let i = 2; i < N; i++) {
fib[i] = fib[i-1] + fib[i-2];
steps[i] = 0;
if (fib[i] === N) {
return 1;
}
}
let base = 0;
let result = -1;
let i = 2;
while (i < fib.length && base <= N) {
let nextPos = base + fib[i];
if (steps[base] === 0) {
base++;
} else if (nextPos > N) {
base++;
i = 2;
} else {
if (nextPos === N) {
if (base === 0) {
return 1;
} else if (result < 0) {
result = steps[base] + 1;
} else {
result = Math.min(result, steps[base] + 1);
}
} else if (A[nextPos-1] === 1) {
if(steps[nextPos] === 0) {
if (base === 0) {
steps[nextPos] = 1;
} else {
steps[nextPos] = steps[base] + 1;
}
} else {
steps[nextPos] = Math.min(steps[nextPos], steps[base] + 1)
}
if (i+1 >= fib.length) {
base++;
i = 2;
}
}
i++;
}
}
return result;
}
User test case 1:
[0, 1, 0, 1, 0]
User test case 2:
[0]
User test case 3:
[0, 1, 1]
User test case 4:
[0, 0, 0, 0, 0, 0, 0, 0]
User test case 5:
[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Analysis
Code: 09:32:01 UTC,
js,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 1;
}
let fib = [0, 1];
let steps = [1, 0];
let N = A.length + 1;
for (let i = 2; i < N; i++) {
fib[i] = fib[i-1] + fib[i-2];
steps[i] = 0;
if (fib[i] === N) {
return 1;
}
}
let base = 0;
let result = -1;
let i = 2;
while (i < fib.length && base <= N) {
let nextPos = base + fib[i];
if (steps[base] === 0) {
base++;
} else if (nextPos > N) {
base++;
i = 2;
} else {
if (nextPos === N) {
if (base === 0) {
return 1;
} else if (result < 0) {
result = steps[base] + 1;
} else {
result = Math.min(result, steps[base] + 1);
}
} else if (A[nextPos-1] === 1) {
if(steps[nextPos] === 0) {
if (base === 0) {
steps[nextPos] = 1;
} else {
steps[nextPos] = steps[base] + 1;
}
} else {
steps[nextPos] = Math.min(steps[nextPos], steps[base] + 1)
}
if (i+1 >= fib.length) {
base++;
i = 2;
}
}
i++;
}
}
return result;
}
Code: 09:32:04 UTC,
js,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 1;
}
let fib = [0, 1];
let steps = [1, 0];
let N = A.length + 1;
for (let i = 2; i < N; i++) {
fib[i] = fib[i-1] + fib[i-2];
steps[i] = 0;
if (fib[i] === N) {
return 1;
}
}
let base = 0;
let result = -1;
let i = 2;
while (i < fib.length && base <= N) {
let nextPos = base + fib[i];
console.log('-> i, N, base, nextPos, steps:', i, A.length+1, base, nextPos, steps)
if (steps[base] === 0) {
base++;
} else if (nextPos > N) {
base++;
i = 2;
} else {
if (nextPos === N) {
if (base === 0) {
return 1;
} else if (result < 0) {
result = steps[base] + 1;
} else {
result = Math.min(result, steps[base] + 1);
}
} else if (A[nextPos-1] === 1) {
if(steps[nextPos] === 0) {
if (base === 0) {
steps[nextPos] = 1;
} else {
steps[nextPos] = steps[base] + 1;
}
} else {
steps[nextPos] = Math.min(steps[nextPos], steps[base] + 1)
}
if (i+1 >= fib.length) {
base++;
i = 2;
}
}
i++;
}
}
return result;
}
Code: 09:32:04 UTC,
js,
verify,
result: Passed
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 1;
}
let fib = [0, 1];
let steps = [1, 0];
let N = A.length + 1;
for (let i = 2; i < N; i++) {
fib[i] = fib[i-1] + fib[i-2];
steps[i] = 0;
if (fib[i] === N) {
return 1;
}
}
let base = 0;
let result = -1;
let i = 2;
while (i < fib.length && base <= N) {
let nextPos = base + fib[i];
console.log('-> i, N, base, nextPos, steps:', i, A.length+1, base, nextPos, steps)
if (steps[base] === 0) {
base++;
} else if (nextPos > N) {
base++;
i = 2;
} else {
if (nextPos === N) {
if (base === 0) {
return 1;
} else if (result < 0) {
result = steps[base] + 1;
} else {
result = Math.min(result, steps[base] + 1);
}
} else if (A[nextPos-1] === 1) {
if(steps[nextPos] === 0) {
if (base === 0) {
steps[nextPos] = 1;
} else {
steps[nextPos] = steps[base] + 1;
}
} else {
steps[nextPos] = Math.min(steps[nextPos], steps[base] + 1)
}
if (i+1 >= fib.length) {
base++;
i = 2;
}
}
i++;
}
}
return result;
}
User test case 1:
[0, 1, 0, 1, 0]
User test case 2:
[0]
User test case 3:
[0, 1, 1]
User test case 4:
[0, 0, 0, 0, 0, 0, 0, 0]
User test case 5:
[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Analysis
expand all
Example tests
1.
0.076 s
OK
stdout:
-> i, N, base, nextPos, steps: 2 12 0 1 [ 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 3 12 0 2 [ 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 4 12 0 3 [ 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 5 12 0 5 [ 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 6 12 0 8 [ 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 7 12 0 13 [ 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 2 12 1 2 [ 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 2 12 2 3 [ 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 2 12 3 4 [ 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 2 12 4 5 [ 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 2 12 5 6 [ 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 3 12 5 7 [ 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 4 12 5 8 [ 1, 0, 0, 0, 0, 1, 0, 2, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 5 12 5 10 [ 1, 0, 0, 0, 0, 1, 0, 2, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 6 12 5 13 [ 1, 0, 0, 0, 0, 1, 0, 2, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 2 12 6 7 [ 1, 0, 0, 0, 0, 1, 0, 2, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 2 12 7 8 [ 1, 0, 0, 0, 0, 1, 0, 2, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 3 12 7 9 [ 1, 0, 0, 0, 0, 1, 0, 2, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 4 12 7 10 [ 1, 0, 0, 0, 0, 1, 0, 2, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 5 12 7 12 [ 1, 0, 0, 0, 0, 1, 0, 2, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 6 12 7 15 [ 1, 0, 0, 0, 0, 1, 0, 2, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 2 12 8 9 [ 1, 0, 0, 0, 0, 1, 0, 2, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 2 12 9 10 [ 1, 0, 0, 0, 0, 1, 0, 2, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 2 12 10 11 [ 1, 0, 0, 0, 0, 1, 0, 2, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 2 12 11 12 [ 1, 0, 0, 0, 0, 1, 0, 2, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 2 12 12 13 [ 1, 0, 0, 0, 0, 1,
expand all
User tests
1.
0.076 s
OK
function result: -1
function result: -1
stdout:
-> i, N, base, nextPos, steps: 2 6 0 1 [ 1, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 3 6 0 2 [ 1, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 4 6 0 3 [ 1, 0, 1, 0, 0, 0 ] -> i, N, base, nextPos, steps: 5 6 0 5 [ 1, 0, 1, 0, 0, 0 ]
1.
0.068 s
OK
function result: 1
function result: 1
1.
0.076 s
OK
function result: 2
function result: 2
stdout:
-> i, N, base, nextPos, steps: 2 4 0 1 [ 1, 0, 0, 0 ] -> i, N, base, nextPos, steps: 3 4 0 2 [ 1, 0, 0, 0 ] -> i, N, base, nextPos, steps: 3 4 1 3 [ 1, 0, 1, 0 ] -> i, N, base, nextPos, steps: 3 4 2 4 [ 1, 0, 1, 0 ]
1.
0.076 s
OK
function result: -1
function result: -1
stdout:
-> i, N, base, nextPos, steps: 2 9 0 1 [ 1, 0, 0, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 3 9 0 2 [ 1, 0, 0, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 4 9 0 3 [ 1, 0, 0, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 5 9 0 5 [ 1, 0, 0, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 6 9 0 8 [ 1, 0, 0, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 7 9 0 13 [ 1, 0, 0, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 2 9 1 2 [ 1, 0, 0, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 2 9 2 3 [ 1, 0, 0, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 2 9 3 4 [ 1, 0, 0, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 2 9 4 5 [ 1, 0, 0, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 2 9 5 6 [ 1, 0, 0, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 2 9 6 7 [ 1, 0, 0, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 2 9 7 8 [ 1, 0, 0, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 2 9 8 9 [ 1, 0, 0, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 2 9 9 10 [ 1, 0, 0, 0, 0, 0, 0, 0, 0 ]
1.
0.080 s
OK
function result: 2
function result: 2
stdout:
-> i, N, base, nextPos, steps: 2 15 0 1 [ 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 3 15 0 2 [ 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 4 15 0 3 [ 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 5 15 0 5 [ 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 6 15 0 8 [ 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 7 15 0 13 [ 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 8 15 0 21 [ 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0 ] -> i, N, base, nextPos, steps: 2 15 1 2 [ 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0 ] -> i, N, base, nextPos, steps: 3 15 1 3 [ 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0 ] -> i, N, base, nextPos, steps: 4 15 1 4 [ 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0 ] -> i, N, base, nextPos, steps: 5 15 1 6 [ 1, 1, 1, 1, 2, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0 ] -> i, N, base, nextPos, steps: 6 15 1 9 [ 1, 1, 1, 1, 2, 1, 2, 0, 1, 0, 0, 0, 0, 1, 0 ] -> i, N, base, nextPos, steps: 7 15 1 14 [ 1, 1, 1, 1, 2, 1, 2, 0, 1, 2, 0, 0, 0, 1, 0 ] -> i, N, base, nextPos, steps: 8 15 1 22 [ 1, 1, 1, 1, 2, 1, 2, 0, 1, 2, 0, 0, 0, 1, 2 ] -> i, N, base, nextPos, steps: 2 15 2 3 [ 1, 1, 1, 1, 2, 1, 2, 0, 1, 2, 0, 0, 0, 1, 2 ] -> i, N, base, nextPos, steps: 3 15 2 4 [ 1, 1, 1, 1, 2, 1, 2, 0, 1, 2, 0, 0, 0, 1, 2 ] -> i, N, base, nextPos, steps: 4 15 2 5 [ 1, 1, 1, 1, 2, 1, 2, 0, 1, 2, 0, 0, 0, 1, 2 ] -> i, N, base, nextPos, steps: 5 15 2 7 [ 1, 1, 1, 1, 2, 1, 2, 0, 1, 2, 0, 0, 0, 1, 2 ] -> i, N, base, nextPos, steps: 6 15 2 10 [ 1, 1, 1, 1, 2, 1, 2, 2, 1, 2, 0, 0, 0, 1, 2 ] -> i, N, base, nextPos, steps: 7 15 2 15 [ 1, 1, 1, 1, 2, 1, 2, 2, 1, 2, 2, 0, 0, 1, 2 ] -> i, N, base, nextPos, steps: 8 15 2 23 [ 1, 1, 1, 1, 2, 1, 2, 2, 1, 2, 2, 0, 0, 1, 2 ] -> i, N, base, nextPos, steps: 2 15 3 4 [ 1, 1, 1, 1, 2, 1, 2, 2, 1, 2, 2, 0, 0, 1, 2 ] -> i, N, base, nextPos, steps: 3 15 3 5 [ 1, 1, 1, 1, 2, 1, 2, 2, 1, 2, 2, 0, 0, 1, 2 ] -> i, N, base, ne
Code: 09:32:47 UTC,
js,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 1;
}
let fib = [0, 1];
let steps = [1, 0];
let N = A.length + 1;
for (let i = 2; i < N; i++) {
fib[i] = fib[i-1] + fib[i-2];
steps[i] = 0;
if (fib[i] === N) {
return 1;
}
}
let base = 0;
let result = -1;
let i = 2;
while (i < fib.length && base <= N) {
let nextPos = base + fib[i];
console.log('-> i, N, base, nextPos, steps:', i, A.length+1, base, nextPos, steps)
if (steps[base] === 0) {
base++;
} else if (nextPos > N) {
base++;
i = 2;
} else {
if (nextPos === N) {
if (base === 0) {
return 1;
} else if (result < 0) {
result = steps[base] + 1;
} else {
result = Math.min(result, steps[base] + 1);
}
} else if (A[nextPos-1] === 1) {
if(steps[nextPos] === 0) {
if (base === 0) {
steps[nextPos] = 1;
} else {
steps[nextPos] = steps[base] + 1;
}
} else {
steps[nextPos] = Math.min(steps[nextPos], steps[base] + 1)
}
}
i++;
}
}
return result;
}
Code: 09:33:00 UTC,
js,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 1;
}
let fib = [0, 1];
let steps = [1, 0];
let N = A.length + 1;
for (let i = 2; i < N; i++) {
fib[i] = fib[i-1] + fib[i-2];
steps[i] = 0;
if (fib[i] === N) {
return 1;
}
}
let base = 0;
let result = -1;
let i = 2;
while (i < fib.length && base <= N) {
let nextPos = base + fib[i];
console.log('-> i, N, base, nextPos, steps:', i, A.length+1, base, nextPos, steps)
if (steps[base] === 0) {
base++;
} else if (nextPos > N) {
base++;
i = 2;
} else {
if (nextPos === N) {
if (base === 0) {
return 1;
} else if (result < 0) {
result = steps[base] + 1;
} else {
result = Math.min(result, steps[base] + 1);
}
} else if (A[nextPos-1] === 1) {
if(steps[nextPos] === 0) {
if (base === 0) {
steps[nextPos] = 1;
} else {
steps[nextPos] = steps[base] + 1;
}
} else {
steps[nextPos] = Math.min(steps[nextPos], steps[base] + 1)
}
}
i++;
if (i >= fib.length) {
base++;
i = 2;
}
}
}
return result;
}
Code: 09:33:05 UTC,
js,
verify,
result: Passed
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 1;
}
let fib = [0, 1];
let steps = [1, 0];
let N = A.length + 1;
for (let i = 2; i < N; i++) {
fib[i] = fib[i-1] + fib[i-2];
steps[i] = 0;
if (fib[i] === N) {
return 1;
}
}
let base = 0;
let result = -1;
let i = 2;
while (i < fib.length && base <= N) {
let nextPos = base + fib[i];
console.log('-> i, N, base, nextPos, steps:', i, A.length+1, base, nextPos, steps)
if (steps[base] === 0) {
base++;
} else if (nextPos > N) {
base++;
i = 2;
} else {
if (nextPos === N) {
if (base === 0) {
return 1;
} else if (result < 0) {
result = steps[base] + 1;
} else {
result = Math.min(result, steps[base] + 1);
}
} else if (A[nextPos-1] === 1) {
if(steps[nextPos] === 0) {
if (base === 0) {
steps[nextPos] = 1;
} else {
steps[nextPos] = steps[base] + 1;
}
} else {
steps[nextPos] = Math.min(steps[nextPos], steps[base] + 1)
}
}
i++;
if (i >= fib.length) {
base++;
i = 2;
}
}
}
return result;
}
User test case 1:
[0, 1, 0, 1, 0]
User test case 2:
[0]
User test case 3:
[0, 1, 1]
User test case 4:
[0, 0, 0, 0, 0, 0, 0, 0]
User test case 5:
[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Analysis
expand all
Example tests
1.
0.076 s
OK
stdout:
-> i, N, base, nextPos, steps: 2 12 0 1 [ 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 3 12 0 2 [ 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 4 12 0 3 [ 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 5 12 0 5 [ 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 6 12 0 8 [ 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 7 12 0 13 [ 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 2 12 1 2 [ 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 2 12 2 3 [ 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 2 12 3 4 [ 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 2 12 4 5 [ 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 2 12 5 6 [ 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 3 12 5 7 [ 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 4 12 5 8 [ 1, 0, 0, 0, 0, 1, 0, 2, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 5 12 5 10 [ 1, 0, 0, 0, 0, 1, 0, 2, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 6 12 5 13 [ 1, 0, 0, 0, 0, 1, 0, 2, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 2 12 6 7 [ 1, 0, 0, 0, 0, 1, 0, 2, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 2 12 7 8 [ 1, 0, 0, 0, 0, 1, 0, 2, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 3 12 7 9 [ 1, 0, 0, 0, 0, 1, 0, 2, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 4 12 7 10 [ 1, 0, 0, 0, 0, 1, 0, 2, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 5 12 7 12 [ 1, 0, 0, 0, 0, 1, 0, 2, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 6 12 7 15 [ 1, 0, 0, 0, 0, 1, 0, 2, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 2 12 8 9 [ 1, 0, 0, 0, 0, 1, 0, 2, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 2 12 9 10 [ 1, 0, 0, 0, 0, 1, 0, 2, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 2 12 10 11 [ 1, 0, 0, 0, 0, 1, 0, 2, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 2 12 11 12 [ 1, 0, 0, 0, 0, 1, 0, 2, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 2 12 12 13 [ 1, 0, 0, 0, 0, 1,
expand all
User tests
1.
0.076 s
OK
function result: 3
function result: 3
stdout:
-> i, N, base, nextPos, steps: 2 6 0 1 [ 1, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 3 6 0 2 [ 1, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 4 6 0 3 [ 1, 0, 1, 0, 0, 0 ] -> i, N, base, nextPos, steps: 5 6 0 5 [ 1, 0, 1, 0, 0, 0 ] -> i, N, base, nextPos, steps: 2 6 1 2 [ 1, 0, 1, 0, 0, 0 ] -> i, N, base, nextPos, steps: 2 6 2 3 [ 1, 0, 1, 0, 0, 0 ] -> i, N, base, nextPos, steps: 3 6 2 4 [ 1, 0, 1, 0, 0, 0 ] -> i, N, base, nextPos, steps: 4 6 2 5 [ 1, 0, 1, 0, 2, 0 ] -> i, N, base, nextPos, steps: 5 6 2 7 [ 1, 0, 1, 0, 2, 0 ] -> i, N, base, nextPos, steps: 2 6 3 4 [ 1, 0, 1, 0, 2, 0 ] -> i, N, base, nextPos, steps: 2 6 4 5 [ 1, 0, 1, 0, 2, 0 ] -> i, N, base, nextPos, steps: 3 6 4 6 [ 1, 0, 1, 0, 2, 0 ] -> i, N, base, nextPos, steps: 4 6 4 7 [ 1, 0, 1, 0, 2, 0 ] -> i, N, base, nextPos, steps: 2 6 5 6 [ 1, 0, 1, 0, 2, 0 ] -> i, N, base, nextPos, steps: 2 6 6 7 [ 1, 0, 1, 0, 2, 0 ]
1.
0.072 s
OK
function result: 1
function result: 1
1.
0.076 s
OK
function result: 2
function result: 2
stdout:
-> i, N, base, nextPos, steps: 2 4 0 1 [ 1, 0, 0, 0 ] -> i, N, base, nextPos, steps: 3 4 0 2 [ 1, 0, 0, 0 ] -> i, N, base, nextPos, steps: 2 4 1 2 [ 1, 0, 1, 0 ] -> i, N, base, nextPos, steps: 2 4 2 3 [ 1, 0, 1, 0 ] -> i, N, base, nextPos, steps: 3 4 2 4 [ 1, 0, 1, 2 ] -> i, N, base, nextPos, steps: 2 4 3 4 [ 1, 0, 1, 2 ] -> i, N, base, nextPos, steps: 3 4 3 5 [ 1, 0, 1, 2 ] -> i, N, base, nextPos, steps: 2 4 4 5 [ 1, 0, 1, 2 ]
1.
0.076 s
OK
function result: -1
function result: -1
stdout:
-> i, N, base, nextPos, steps: 2 9 0 1 [ 1, 0, 0, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 3 9 0 2 [ 1, 0, 0, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 4 9 0 3 [ 1, 0, 0, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 5 9 0 5 [ 1, 0, 0, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 6 9 0 8 [ 1, 0, 0, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 7 9 0 13 [ 1, 0, 0, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 2 9 1 2 [ 1, 0, 0, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 2 9 2 3 [ 1, 0, 0, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 2 9 3 4 [ 1, 0, 0, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 2 9 4 5 [ 1, 0, 0, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 2 9 5 6 [ 1, 0, 0, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 2 9 6 7 [ 1, 0, 0, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 2 9 7 8 [ 1, 0, 0, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 2 9 8 9 [ 1, 0, 0, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 2 9 9 10 [ 1, 0, 0, 0, 0, 0, 0, 0, 0 ]
1.
0.080 s
OK
function result: 2
function result: 2
stdout:
-> i, N, base, nextPos, steps: 2 15 0 1 [ 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 3 15 0 2 [ 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 4 15 0 3 [ 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 5 15 0 5 [ 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 6 15 0 8 [ 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 7 15 0 13 [ 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0 ] -> i, N, base, nextPos, steps: 8 15 0 21 [ 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0 ] -> i, N, base, nextPos, steps: 2 15 1 2 [ 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0 ] -> i, N, base, nextPos, steps: 3 15 1 3 [ 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0 ] -> i, N, base, nextPos, steps: 4 15 1 4 [ 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0 ] -> i, N, base, nextPos, steps: 5 15 1 6 [ 1, 1, 1, 1, 2, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0 ] -> i, N, base, nextPos, steps: 6 15 1 9 [ 1, 1, 1, 1, 2, 1, 2, 0, 1, 0, 0, 0, 0, 1, 0 ] -> i, N, base, nextPos, steps: 7 15 1 14 [ 1, 1, 1, 1, 2, 1, 2, 0, 1, 2, 0, 0, 0, 1, 0 ] -> i, N, base, nextPos, steps: 8 15 1 22 [ 1, 1, 1, 1, 2, 1, 2, 0, 1, 2, 0, 0, 0, 1, 2 ] -> i, N, base, nextPos, steps: 2 15 2 3 [ 1, 1, 1, 1, 2, 1, 2, 0, 1, 2, 0, 0, 0, 1, 2 ] -> i, N, base, nextPos, steps: 3 15 2 4 [ 1, 1, 1, 1, 2, 1, 2, 0, 1, 2, 0, 0, 0, 1, 2 ] -> i, N, base, nextPos, steps: 4 15 2 5 [ 1, 1, 1, 1, 2, 1, 2, 0, 1, 2, 0, 0, 0, 1, 2 ] -> i, N, base, nextPos, steps: 5 15 2 7 [ 1, 1, 1, 1, 2, 1, 2, 0, 1, 2, 0, 0, 0, 1, 2 ] -> i, N, base, nextPos, steps: 6 15 2 10 [ 1, 1, 1, 1, 2, 1, 2, 2, 1, 2, 0, 0, 0, 1, 2 ] -> i, N, base, nextPos, steps: 7 15 2 15 [ 1, 1, 1, 1, 2, 1, 2, 2, 1, 2, 2, 0, 0, 1, 2 ] -> i, N, base, nextPos, steps: 8 15 2 23 [ 1, 1, 1, 1, 2, 1, 2, 2, 1, 2, 2, 0, 0, 1, 2 ] -> i, N, base, nextPos, steps: 2 15 3 4 [ 1, 1, 1, 1, 2, 1, 2, 2, 1, 2, 2, 0, 0, 1, 2 ] -> i, N, base, nextPos, steps: 3 15 3 5 [ 1, 1, 1, 1, 2, 1, 2, 2, 1, 2, 2, 0, 0, 1, 2 ] -> i, N, base, ne
Code: 09:35:26 UTC,
js,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 1;
}
let fib = [0, 1];
let steps = [1, 0];
let N = A.length + 1;
for (let i = 2; i < N; i++) {
fib[i] = fib[i-1] + fib[i-2];
steps[i] = 0;
if (fib[i] === N) {
return 1;
}
}
let base = 0;
let result = -1;
let i = 2;
while (i < fib.length && base <= N) {
let nextPos = base + fib[i];
// console.log('-> i, N, base, nextPos, steps:', i, A.length+1, base, nextPos, steps)
if (steps[base] === 0) {
base++;
} else if (nextPos > N) {
base++;
i = 2;
} else {
if (nextPos === N) {
if (base === 0) {
return 1;
} else if (result < 0) {
result = steps[base] + 1;
} else {
result = Math.min(result, steps[base] + 1);
}
} else if (A[nextPos-1] === 1) {
if(steps[nextPos] === 0) {
if (base === 0) {
steps[nextPos] = 1;
} else {
steps[nextPos] = steps[base] + 1;
}
} else {
steps[nextPos] = Math.min(steps[nextPos], steps[base] + 1)
}
}
i++;
if (i >= fib.length) {
base++;
i = 2;
}
}
}
return result;
}
Code: 09:35:35 UTC,
js,
verify,
result: Passed
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 1;
}
let fib = [0, 1];
let steps = [1, 0];
let N = A.length + 1;
for (let i = 2; i < N; i++) {
fib[i] = fib[i-1] + fib[i-2];
steps[i] = 0;
if (fib[i] === N) {
return 1;
}
}
let base = 0;
let result = -1;
let i = 2;
while (i < fib.length && base <= N) {
let nextPos = base + fib[i];
// console.log('-> i, N, base, nextPos, steps:', i, A.length+1, base, nextPos, steps)
if (steps[base] === 0) {
base++;
} else if (nextPos > N) {
base++;
i = 2;
} else {
if (nextPos === N) {
if (base === 0) {
return 1;
} else if (result < 0) {
result = steps[base] + 1;
} else {
result = Math.min(result, steps[base] + 1);
}
} else if (A[nextPos-1] === 1) {
if(steps[nextPos] === 0) {
if (base === 0) {
steps[nextPos] = 1;
} else {
steps[nextPos] = steps[base] + 1;
}
} else {
steps[nextPos] = Math.min(steps[nextPos], steps[base] + 1)
}
}
i++;
if (i >= fib.length) {
base++;
i = 2;
}
}
}
return result;
}
User test case 1:
[0, 1, 0, 1, 0]
User test case 2:
[0]
User test case 3:
[0, 1, 1]
User test case 4:
[0, 0, 0, 0, 0, 0, 0, 0]
User test case 5:
[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Analysis
Code: 09:35:51 UTC,
js,
verify,
result: Passed
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 1;
}
let fib = [0, 1];
let steps = [1, 0];
let N = A.length + 1;
for (let i = 2; i < N; i++) {
fib[i] = fib[i-1] + fib[i-2];
steps[i] = 0;
if (fib[i] === N) {
return 1;
}
}
let base = 0;
let result = -1;
let i = 2;
while (i < fib.length && base <= N) {
let nextPos = base + fib[i];
// console.log('-> i, N, base, nextPos, steps:', i, A.length+1, base, nextPos, steps)
if (steps[base] === 0) {
base++;
} else if (nextPos > N) {
base++;
i = 2;
} else {
if (nextPos === N) {
if (base === 0) {
return 1;
} else if (result < 0) {
result = steps[base] + 1;
} else {
result = Math.min(result, steps[base] + 1);
}
} else if (A[nextPos-1] === 1) {
if(steps[nextPos] === 0) {
if (base === 0) {
steps[nextPos] = 1;
} else {
steps[nextPos] = steps[base] + 1;
}
} else {
steps[nextPos] = Math.min(steps[nextPos], steps[base] + 1)
}
}
i++;
if (i >= fib.length) {
base++;
i = 2;
}
}
}
return result;
}
User test case 1:
[0, 1, 0, 1, 0]
User test case 2:
[0]
User test case 3:
[0, 1, 1]
User test case 4:
[0, 0, 0, 0, 0, 0, 0, 0]
User test case 5:
[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
User test case 6:
[0, 0, 0, 0, 0, 0, 0, 0, 0]
Analysis
expand all
User tests
1.
0.080 s
OK
function result: 3
function result: 3
1.
0.068 s
OK
function result: 1
function result: 1
1.
0.068 s
OK
function result: 2
function result: 2
1.
0.068 s
OK
function result: -1
function result: -1
1.
0.068 s
OK
function result: 2
function result: 2
1.
0.068 s
OK
function result: -1
function result: -1
Code: 09:35:57 UTC,
js,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 1;
}
let fib = [0, 1];
let steps = [1, 0];
let N = A.length + 1;
for (let i = 2; i < N; i++) {
fib[i] = fib[i-1] + fib[i-2];
steps[i] = 0;
if (fib[i] === N) {
return 1;
}
}
let base = 0;
let result = -1;
let i = 2;
while (i < fib.length && base <= N) {
let nextPos = base + fib[i];
// console.log('-> i, N, base, nextPos, steps:', i, A.length+1, base, nextPos, steps)
if (steps[base] === 0) {
base++;
} else if (nextPos > N) {
base++;
i = 2;
} else {
if (nextPos === N) {
if (base === 0) {
return 1;
} else if (result < 0) {
result = steps[base] + 1;
} else {
result = Math.min(result, steps[base] + 1);
}
} else if (A[nextPos-1] === 1) {
if(steps[nextPos] === 0) {
if (base === 0) {
steps[nextPos] = 1;
} else {
steps[nextPos] = steps[base] + 1;
}
} else {
steps[nextPos] = Math.min(steps[nextPos], steps[base] + 1)
}
}
i++;
if (i >= fib.length) {
base++;
i = 2;
}
}
}
return result;
}
Code: 09:35:58 UTC,
js,
verify,
result: Passed
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 1;
}
let fib = [0, 1];
let steps = [1, 0];
let N = A.length + 1;
for (let i = 2; i < N; i++) {
fib[i] = fib[i-1] + fib[i-2];
steps[i] = 0;
if (fib[i] === N) {
return 1;
}
}
let base = 0;
let result = -1;
let i = 2;
while (i < fib.length && base <= N) {
let nextPos = base + fib[i];
// console.log('-> i, N, base, nextPos, steps:', i, A.length+1, base, nextPos, steps)
if (steps[base] === 0) {
base++;
} else if (nextPos > N) {
base++;
i = 2;
} else {
if (nextPos === N) {
if (base === 0) {
return 1;
} else if (result < 0) {
result = steps[base] + 1;
} else {
result = Math.min(result, steps[base] + 1);
}
} else if (A[nextPos-1] === 1) {
if(steps[nextPos] === 0) {
if (base === 0) {
steps[nextPos] = 1;
} else {
steps[nextPos] = steps[base] + 1;
}
} else {
steps[nextPos] = Math.min(steps[nextPos], steps[base] + 1)
}
}
i++;
if (i >= fib.length) {
base++;
i = 2;
}
}
}
return result;
}
User test case 1:
[0, 1, 0, 1, 0]
User test case 2:
[0]
User test case 3:
[0, 1, 1]
User test case 4:
[0, 0, 0, 0, 0, 0, 0, 0]
User test case 5:
[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
User test case 6:
[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Analysis
expand all
User tests
1.
0.068 s
OK
function result: 3
function result: 3
1.
0.068 s
OK
function result: 1
function result: 1
1.
0.068 s
OK
function result: 2
function result: 2
1.
0.072 s
OK
function result: -1
function result: -1
1.
0.068 s
OK
function result: 2
function result: 2
1.
0.084 s
OK
function result: -1
function result: -1
Code: 09:36:06 UTC,
js,
verify,
result: Passed
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 1;
}
let fib = [0, 1];
let steps = [1, 0];
let N = A.length + 1;
for (let i = 2; i < N; i++) {
fib[i] = fib[i-1] + fib[i-2];
steps[i] = 0;
if (fib[i] === N) {
return 1;
}
}
let base = 0;
let result = -1;
let i = 2;
while (i < fib.length && base <= N) {
let nextPos = base + fib[i];
// console.log('-> i, N, base, nextPos, steps:', i, A.length+1, base, nextPos, steps)
if (steps[base] === 0) {
base++;
} else if (nextPos > N) {
base++;
i = 2;
} else {
if (nextPos === N) {
if (base === 0) {
return 1;
} else if (result < 0) {
result = steps[base] + 1;
} else {
result = Math.min(result, steps[base] + 1);
}
} else if (A[nextPos-1] === 1) {
if(steps[nextPos] === 0) {
if (base === 0) {
steps[nextPos] = 1;
} else {
steps[nextPos] = steps[base] + 1;
}
} else {
steps[nextPos] = Math.min(steps[nextPos], steps[base] + 1)
}
}
i++;
if (i >= fib.length) {
base++;
i = 2;
}
}
}
return result;
}
User test case 1:
[0, 1, 0, 1, 0]
User test case 2:
[0]
User test case 3:
[0, 1, 1]
User test case 4:
[0, 0, 0, 0, 0, 0, 0, 0]
User test case 5:
[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
User test case 6:
[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Analysis
expand all
User tests
1.
0.076 s
OK
function result: 3
function result: 3
1.
0.076 s
OK
function result: 1
function result: 1
1.
0.076 s
OK
function result: 2
function result: 2
1.
0.076 s
OK
function result: -1
function result: -1
1.
0.076 s
OK
function result: 2
function result: 2
1.
0.076 s
OK
function result: -1
function result: -1
Code: 09:36:12 UTC,
js,
verify,
result: Passed
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 1;
}
let fib = [0, 1];
let steps = [1, 0];
let N = A.length + 1;
for (let i = 2; i < N; i++) {
fib[i] = fib[i-1] + fib[i-2];
steps[i] = 0;
if (fib[i] === N) {
return 1;
}
}
let base = 0;
let result = -1;
let i = 2;
while (i < fib.length && base <= N) {
let nextPos = base + fib[i];
// console.log('-> i, N, base, nextPos, steps:', i, A.length+1, base, nextPos, steps)
if (steps[base] === 0) {
base++;
} else if (nextPos > N) {
base++;
i = 2;
} else {
if (nextPos === N) {
if (base === 0) {
return 1;
} else if (result < 0) {
result = steps[base] + 1;
} else {
result = Math.min(result, steps[base] + 1);
}
} else if (A[nextPos-1] === 1) {
if(steps[nextPos] === 0) {
if (base === 0) {
steps[nextPos] = 1;
} else {
steps[nextPos] = steps[base] + 1;
}
} else {
steps[nextPos] = Math.min(steps[nextPos], steps[base] + 1)
}
}
i++;
if (i >= fib.length) {
base++;
i = 2;
}
}
}
return result;
}
User test case 1:
[0, 1, 0, 1, 0]
User test case 2:
[0]
User test case 3:
[0, 1, 1]
User test case 4:
[0, 0, 0, 0, 0, 0, 0, 0]
User test case 5:
[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
User test case 6:
[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Analysis
expand all
User tests
1.
0.068 s
OK
function result: 3
function result: 3
1.
0.068 s
OK
function result: 1
function result: 1
1.
0.068 s
OK
function result: 2
function result: 2
1.
0.072 s
OK
function result: -1
function result: -1
1.
0.068 s
OK
function result: 2
function result: 2
1.
0.068 s
OK
function result: 1
function result: 1
Code: 09:36:27 UTC,
js,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 1;
}
let fib = [0, 1];
let steps = [1, 0];
let N = A.length + 1;
for (let i = 2; i < N; i++) {
fib[i] = fib[i-1] + fib[i-2];
steps[i] = 0;
if (fib[i] === N) {
return 1;
}
}
let base = 0;
let result = -1;
let i = 2;
while (i < fib.length && base <= N) {
let nextPos = base + fib[i];
// console.log('-> i, N, base, nextPos, steps:', i, A.length+1, base, nextPos, steps)
if (steps[base] === 0) {
base++;
} else if (nextPos > N) {
base++;
i = 2;
} else {
if (nextPos === N) {
if (base === 0) {
return 1;
} else if (result < 0) {
result = steps[base] + 1;
} else {
result = Math.min(result, steps[base] + 1);
}
} else if (A[nextPos-1] === 1) {
if(steps[nextPos] === 0) {
if (base === 0) {
steps[nextPos] = 1;
} else {
steps[nextPos] = steps[base] + 1;
}
} else {
steps[nextPos] = Math.min(steps[nextPos], steps[base] + 1)
}
}
i++;
if (i >= fib.length) {
base++;
i = 2;
}
}
}
return result;
}
Code: 09:36:28 UTC,
js,
verify,
result: Passed
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 1;
}
let fib = [0, 1];
let steps = [1, 0];
let N = A.length + 1;
for (let i = 2; i < N; i++) {
fib[i] = fib[i-1] + fib[i-2];
steps[i] = 0;
if (fib[i] === N) {
return 1;
}
}
let base = 0;
let result = -1;
let i = 2;
while (i < fib.length && base <= N) {
let nextPos = base + fib[i];
// console.log('-> i, N, base, nextPos, steps:', i, A.length+1, base, nextPos, steps)
if (steps[base] === 0) {
base++;
} else if (nextPos > N) {
base++;
i = 2;
} else {
if (nextPos === N) {
if (base === 0) {
return 1;
} else if (result < 0) {
result = steps[base] + 1;
} else {
result = Math.min(result, steps[base] + 1);
}
} else if (A[nextPos-1] === 1) {
if(steps[nextPos] === 0) {
if (base === 0) {
steps[nextPos] = 1;
} else {
steps[nextPos] = steps[base] + 1;
}
} else {
steps[nextPos] = Math.min(steps[nextPos], steps[base] + 1)
}
}
i++;
if (i >= fib.length) {
base++;
i = 2;
}
}
}
return result;
}
User test case 1:
[0, 1, 0, 1, 0]
User test case 2:
[0]
User test case 3:
[0, 1, 1]
User test case 4:
[0, 0, 0, 0, 0, 0, 0, 0]
User test case 5:
[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
User test case 6:
[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
User test case 7:
[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Analysis
expand all
User tests
1.
0.068 s
OK
function result: 3
function result: 3
1.
0.068 s
OK
function result: 1
function result: 1
1.
0.072 s
OK
function result: 2
function result: 2
1.
0.068 s
OK
function result: -1
function result: -1
1.
0.072 s
OK
function result: 2
function result: 2
1.
0.068 s
OK
function result: 1
function result: 1
1.
0.068 s
OK
function result: 1
function result: 1
Code: 09:37:05 UTC,
js,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 1;
}
let fib = [0, 1];
let steps = [1, 0];
let N = A.length + 1;
for (let i = 2; i < N; i++) {
fib[i] = fib[i-1] + fib[i-2];
steps[i] = 0;
if (fib[i] === N) {
return 1;
}
}
let base = 0;
let result = -1;
let i = 2;
while (i < fib.length && base <= N) {
let nextPos = base + fib[i];
// console.log('-> i, N, base, nextPos, steps:', i, A.length+1, base, nextPos, steps)
if (steps[base] === 0) {
base++;
} else if (nextPos > N) {
base++;
i = 2;
} else {
if (nextPos === N) {
if (base === 0) {
return 1;
} else if (result < 0) {
result = steps[base] + 1;
} else {
result = Math.min(result, steps[base] + 1);
}
} else if (A[nextPos-1] === 1) {
if(steps[nextPos] === 0) {
if (base === 0) {
steps[nextPos] = 1;
} else {
steps[nextPos] = steps[base] + 1;
}
} else {
steps[nextPos] = Math.min(steps[nextPos], steps[base] + 1)
}
}
i++;
if (i >= fib.length) {
base++;
i = 2;
}
}
}
return result;
}
Code: 09:37:20 UTC,
js,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 1;
}
let fib = [0, 1];
let steps = [1, 0];
let N = A.length + 1;
for (let i = 2; i < N; i++) {
fib[i] = fib[i-1] + fib[i-2];
steps[i] = 0;
if (fib[i] === N) {
return 1;
}
}
let base = 0;
let result = -1;
let i = 2;
while (i < fib.length && base <= N) {
let nextPos = base + fib[i];
// console.log('-> i, N, base, nextPos, steps:', i, A.length+1, base, nextPos, steps)
if (steps[base] === 0) {
base++;
} else if (nextPos > N) {
base++;
i = 2;
} else {
if (nextPos === N) {
if (base === 0) {
return 1;
} else if (result < 0) {
result = steps[base] + 1;
} else {
result = Math.min(result, steps[base] + 1);
}
} else if (A[nextPos-1] === 1) {
if(steps[nextPos] === 0) {
if (base === 0) {
steps[nextPos] = 1;
} else {
steps[nextPos] = steps[base] + 1;
}
} else {
steps[nextPos] = Math.min(steps[nextPos], steps[base] + 1)
}
}
i++;
if (i >= fib.length) {
base++;
i = 2;
}
}
}
return result;
}
Code: 09:37:28 UTC,
js,
verify,
result: Passed
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 1;
}
let fib = [0, 1];
let steps = [1, 0];
let N = A.length + 1;
for (let i = 2; i < N; i++) {
fib[i] = fib[i-1] + fib[i-2];
steps[i] = 0;
if (fib[i] === N) {
return 1;
}
}
let base = 0;
let result = -1;
let i = 2;
while (i < fib.length && base <= N) {
let nextPos = base + fib[i];
// console.log('-> i, N, base, nextPos, steps:', i, A.length+1, base, nextPos, steps)
if (steps[base] === 0) {
base++;
} else if (nextPos > N) {
base++;
i = 2;
} else {
if (nextPos === N) {
if (base === 0) {
return 1;
} else if (result < 0) {
result = steps[base] + 1;
} else {
result = Math.min(result, steps[base] + 1);
}
} else if (A[nextPos-1] === 1) {
if(steps[nextPos] === 0) {
if (base === 0) {
steps[nextPos] = 1;
} else {
steps[nextPos] = steps[base] + 1;
}
} else {
steps[nextPos] = Math.min(steps[nextPos], steps[base] + 1)
}
}
i++;
if (i >= fib.length) {
base++;
i = 2;
}
}
}
return result;
}
User test case 1:
[0, 1, 0, 1, 0]
User test case 2:
[0]
User test case 3:
[0, 1, 1]
User test case 4:
[0, 0, 0, 0, 0, 0, 0, 0]
User test case 5:
[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
User test case 6:
[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
User test case 7:
[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
User test case 8:
[0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1]
Analysis
expand all
User tests
1.
0.068 s
OK
function result: 3
function result: 3
1.
0.068 s
OK
function result: 1
function result: 1
1.
0.068 s
OK
function result: 2
function result: 2
1.
0.068 s
OK
function result: -1
function result: -1
1.
0.068 s
OK
function result: 2
function result: 2
1.
0.068 s
OK
function result: 1
function result: 1
1.
0.068 s
OK
function result: 1
function result: 1
1.
0.068 s
OK
function result: 3
function result: 3
Code: 09:37:39 UTC,
js,
verify,
result: Passed
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 1;
}
let fib = [0, 1];
let steps = [1, 0];
let N = A.length + 1;
for (let i = 2; i < N; i++) {
fib[i] = fib[i-1] + fib[i-2];
steps[i] = 0;
if (fib[i] === N) {
return 1;
}
}
let base = 0;
let result = -1;
let i = 2;
while (i < fib.length && base <= N) {
let nextPos = base + fib[i];
// console.log('-> i, N, base, nextPos, steps:', i, A.length+1, base, nextPos, steps)
if (steps[base] === 0) {
base++;
} else if (nextPos > N) {
base++;
i = 2;
} else {
if (nextPos === N) {
if (base === 0) {
return 1;
} else if (result < 0) {
result = steps[base] + 1;
} else {
result = Math.min(result, steps[base] + 1);
}
} else if (A[nextPos-1] === 1) {
if(steps[nextPos] === 0) {
if (base === 0) {
steps[nextPos] = 1;
} else {
steps[nextPos] = steps[base] + 1;
}
} else {
steps[nextPos] = Math.min(steps[nextPos], steps[base] + 1)
}
}
i++;
if (i >= fib.length) {
base++;
i = 2;
}
}
}
return result;
}
User test case 1:
[0, 1, 0, 1, 0]
User test case 2:
[0]
User test case 3:
[0, 1, 1]
User test case 4:
[0, 0, 0, 0, 0, 0, 0, 0]
User test case 5:
[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
User test case 6:
[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
User test case 7:
[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
User test case 8:
[0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1]
Analysis
expand all
User tests
1.
0.068 s
OK
function result: 3
function result: 3
1.
0.068 s
OK
function result: 1
function result: 1
1.
0.068 s
OK
function result: 2
function result: 2
1.
0.068 s
OK
function result: -1
function result: -1
1.
0.068 s
OK
function result: 2
function result: 2
1.
0.068 s
OK
function result: 1
function result: 1
1.
0.068 s
OK
function result: 1
function result: 1
1.
0.068 s
OK
function result: 3
function result: 3
Code: 09:37:42 UTC,
js,
final,
score:
100
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 1;
}
let fib = [0, 1];
let steps = [1, 0];
let N = A.length + 1;
for (let i = 2; i < N; i++) {
fib[i] = fib[i-1] + fib[i-2];
steps[i] = 0;
if (fib[i] === N) {
return 1;
}
}
let base = 0;
let result = -1;
let i = 2;
while (i < fib.length && base <= N) {
let nextPos = base + fib[i];
// console.log('-> i, N, base, nextPos, steps:', i, A.length+1, base, nextPos, steps)
if (steps[base] === 0) {
base++;
} else if (nextPos > N) {
base++;
i = 2;
} else {
if (nextPos === N) {
if (base === 0) {
return 1;
} else if (result < 0) {
result = steps[base] + 1;
} else {
result = Math.min(result, steps[base] + 1);
}
} else if (A[nextPos-1] === 1) {
if(steps[nextPos] === 0) {
if (base === 0) {
steps[nextPos] = 1;
} else {
steps[nextPos] = steps[base] + 1;
}
} else {
steps[nextPos] = Math.min(steps[nextPos], steps[base] + 1)
}
}
i++;
if (i >= fib.length) {
base++;
i = 2;
}
}
}
return result;
}
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.072 s
OK
1.
0.072 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.072 s
OK
3.
0.072 s
OK
4.
0.072 s
OK
1.
0.072 s
OK
expand all
Performance tests
1.
0.088 s
OK
1.
0.096 s
OK
1.
0.124 s
OK
2.
0.112 s
OK
3.
0.108 s
OK
1.
0.148 s
OK
2.
0.120 s
OK
1.
0.156 s
OK
1.
0.124 s
OK
2.
0.172 s
OK