12 lines
306 B
Text
12 lines
306 B
Text
const n = 0d100_000;
|
|
q:=(n+1).pump(List.createLong(n+1).write); // (0,1,2,...,n) base 1
|
|
q[1] = q[2] = 1;
|
|
|
|
foreach i in ([3..n]) { q[i] = q[i - q[i - 1]] + q[i - q[i - 2]] }
|
|
|
|
q[1,10].concat(" ").println();
|
|
println(q[1000]);
|
|
|
|
flip := 0;
|
|
foreach i in (n){ flip += (q[i] > q[i + 1]) }
|
|
println("flips: ",flip);
|