The second part of Day 10 gave me a lot of work to get done. :grinning: I tried to apply the design recipe and I am really satisfied with the result.

today was very bad for me — I think because I was rushing

I struggled with the logic to sort the points. I bet there is a simpler way to sort the points that is not a combination of quadrant, slope and distance.

What were your mistakes?

@wanderley.guimaraes use atan and gcd!

I tried to use atan but I gave up. I don’t see how to apply gcd in this problem but I think again about the problem. Thanks for the hints!

Ow!

gcd will tell how many integers points in a segment! That is cleaver and will remove my nested loop.