Optimise Day 22 part 1

[abavoil]

To make the search for the n-th price in O(log(n)) time instead of O(n), compute the transition for n=1, then use it twice to compute the transition for n=2, then use it twice to compute the transition for n=4, etc until 2^23.