Given a program written in Crystal, there is an inefficient algorithm to find the nth lexicographical permutation of an array. Reimplement this with a better algorithm to get flag.
Original writeup (https://daniellimws.github.io/hitcon-quals-19/suicune).