okay...i've got another wired counting problem, this time it's about rectangles!

gotta find the minimum number of lines to divide a rectangle into squares! i went for...ehh

well a dumb idea of cutting the max square off, and cutting the little ones recursively, but...

doesn't always work.

you're given the two dimensions of the rectangle...that's it. both are integers btw.

0