Substring of Fibonacci String
Given an infinite set of string \$f_0, f_1, ...\$ where:
\begin{cases}
f_0 = \text{0}\\
f_1 = \text{1}\\
f_i = f_{i-1} + f_{i-2},&∀i > 1
\end{cases}
Consequently, when extending further from \$f_1\$, we get:
\begin{cases}
f_0 = \text{0}\\
f_1 = \text{1}\\
f_2 = \text...
Fibonacci Sequence modulo M
Given integers \$a,b,m, k, n\$ and array \$F = (f_1, f_2,...,f_n)\$ defined as:
\begin{cases}
f_1 = \text{a}\\
f_2 = \text{b}\\
f_i = (f_{i-1} + f_{i-2}) \text{ mod m},∀i > 2
\end{cases}
When \$F\$ array is sorted into a non-decreasing sequence, your task is to find th...
Given integers \$a,b,m, k, n\$ and array \$F = (f_1, f_2,...,f_n)\$ defined as:
\begin{cases}
f_1 = \text{a}\\
f_2 = \text{b}\\
f_i = (f_{i-1} + f_{i-2}) \text{ mod m},∀i > 2
\end{cases}
When \$F\$ array is sorted into a non-decreasing sequence, your task is to find the \$k\$-th integer of the so...
