当前你的浏览器版本过低，网站已在兼容模式下运行，兼容模式仅提供最小功能支持，网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。
Two polygons on a plane are described by the coordinates of their vertices in anticlockwise order. The polygons are otherwise arbitrary but it is known that no three sequential vertices lie on the same line. It is suspected that the two polygons are parts of one bigger convex polygon that was split in two.
Write a program to check the guess on the condition that it is allowed to move and rotate, but not to invert the parts to match them together. All computations should be made with the precision of 0.001.The first line contains an integer N1 (3≤N1≤100) – the number of vertices of the first polygon. Each of the following N1 lines contains two real numbers X, Y separated by one space – the coordinates of one vertex. The rest of the file describes the second polygon in similar manner.
The first and only line of the output must contain the number 1 if the guess is correct, and 0 otherwise.
7 0 0 4 0 4 1 3 3.5 4 4 4 5 0 5 7 6 0 11 0 11 4 10 4 9.5 5 7 4 6 4
1
| 时间上限 | 内存上限 |
| 1000 | 65536 |