Polygon Programming with Ease

Description

Read the statement of Problem 1939! Given a list of meeting locations as specified in the description of Problem 1939, you have to calculate the locations of the Foreign Offices.
Input

See the input specification of Problem 1939 for the format, and the output specification of Problem 1939 for the meaning of the input.
Output

See the output specification of Problem 1939 for the format, and the input specification of Problem 1939 for the meaning of the output.
Sample Input

5 14 2 20 4 18 12 12 18 10 10
3 -3 5 -2 5 -3 6
3 -2 10 5 10 -1 12
Sample Output

5 10.000000 2.000000 18.000000 2.000000 22.000000 6.000000 14.000000 18.000000 10.000000 18.000000
3 -4.000000 6.000000 -2.000000 4.000000 -2.000000 6.000000
3 -8.000000 12.000000 4.000000 8.000000 6.000000 12.000000

http://blog.csdn.net/V5ZSQ/article/details/46799995?locationNum=10

谢谢分享,不错ꉂ ೭(˵¯̴͒ꇴ¯̴͒˵)౨”