Polygon Programming with Ease - Problems

Read the statement of \textbf{Problem 1046}! Given a list of meeting locations as specified in the description of \textbf{Problem 1046}, you have to calculate the locations of the Foreign Offices. \InputFile See the input specification of \textbf{Problem 1046} for the format, and the output specification of \textbf{Problem 1046} for the meaning of the input. \OutputFile See the output specification of \textbf{Problem 1046} for the format, and the input specification of \textbf{Problem 1046} for the meaning of the output. \textbf{Remark} The relationship between the sample input and output polygons is illustrated in the figure below. Solid lines indicate the polygon joining the Foreign Offices, whereas dashed lines indicate the polygon joining the meeting locations. To generate further sample input you may use your solution to \textbf{Problem 1046}. \includegraphics{http://www.informatik.uni-ulm.de/acm/Locals/2002/html/images/ease.gif}

Time limit 1 second

Memory limit 64 MiB

Input example #1

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

Output example #1

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

Show problem classification