Introduction - If you have any usage issues, please Google them yourself
Fibonacci packing problem: given a continuous first N Fibonacci side length of the square, they need to be installed in a rectangle, not allowed to have any gaps, then the size and output of each rectangle the coordinates of the upper left corner of the square, any one can