Fibonacci strings#5437
The Fibonacci string is a binary string containing only 0 and 1 that does not have two consecutive ones.
Given the lexicographic number of a Fibonacci string, construct and print the corresponding string. The lexicographic number is the position in the ordered set of all such strings of given length (sorted as in a dictionary). Numbering starts from one.
The input contains two integers: the length of the Fibonacci string (1 \le n \le 44) and the string number . It is guaranteed that the string with number exists.
Print the -th Fibonacci string of length .
Example 1
Example 2