Talk:LA - Tiling the Plane

No team was able to solve this problem at the ICPC world finals. This problem is especially hard to analyze because of the lack of input restrictions. We know that the polygon has at most 50 sides, but the sides could be of any length. The "extra information" given is obviously very useful, but determining the locations of points A,B,C,D or A,B,C,D,E,F could be tricky, since they aren't necessarily on the vertices of the polygon. A brute force approach at determining the points' locations would fail when the side lengths are huge. What shortcut could be used to deal with, say, relatively prime side lengths? --Jeff 14:13, 9 Sep 2005 (EDT)