##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
(Example execution)
Graph: . This forms a cycle of length . Query: start at , go steps. You need to find where you land. Jump table: , , .
Each row is built from the previous row by composing the function. in binary: . Start at . Jump : reach . Jump : reach . Jump : reach . Answer: . The binary decomposition makes it efficient.
