Tile#8660
Baytik's father works as a builder. One evening, he came home and started to think about the following problem. He has tiles of width cm and cm. Each type of tile can be laid with a gap of mm and mm, respectively, where 1 \le x, y \le 5. The task is to determine values of and such that the total length of the two layouts (each consisting of tiles of one type separated by the chosen gap) is equal and minimized.
The widths of the tiles are given as integers and , where 1 \le a, b < 10^8.
Output the values of the gaps and (in millimeters), as well as the minimal common total length of the layouts (in centimeters), rounded to one decimal place.
Example 1