no news, closing.

(deleted: double post... :/ )

When cutting the cake
................
.....o..........
................
...............o
................
................
................
.....o..o.....o.
................
................
...o............
................
................
...............o
................
.o..............
Test Failed
Expected:
[
................
.....o..........
]
,
[
................
...............o
]
,
[
........
........
........
.....o..
]
,
[
....
....
....
o...
....
....
....
....
]
,
[
....
....
....
..o.
....
....
....
....
]
,
[
........
........
...o....
........
]
,
[
................
...............o
]
,
[
................
.o..............
]
Actual:
[
........
.....o..
........
........
]
,
[
........
........
........
.......o
]
,
[
........
........
........
.....o..
]
,
[
....
....
....
o...
....
....
....
....
]
,
[
....
....
....
..o.
....
....
....
....
]
,
[
........
........
...o....
........
]
,
[
........
........
........
.o......
]
,
[
........
.......o
........
........
]
My first element is largest width, but test Failed
Help me

Thanks for the help)

I am afraid that would amount to giving the solution away.

I need help. Using the search method, the problem is solved, but it exceeds the execution time. I tried the method of binary algorithm for calculating the greatest common divisor, but it still takes a long time, exceeds the time of 16000 ms. Please tell me a more effective way to solve.