Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|

Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |

Language: Geometrical dreams
Description There is a polygon A _{1}A_{2}...A_{n} (the vertices A_{i} are numbered in the clockwise order). On each side A_{i}A_{i+1 }an isosceles triangle A_{i}M_{i}A_{i+1} is built on the outer side of the polygon, and angle A_{i}M_{i}A_{i+1 }= α_{i}. Here A_{n+1} = A_{1}.
The set of angles a _{i} satisfies a condition that the sum of angles in any of its nonempty subsets is not aliquot to 360 degrees.
You are given n <= 50, co-ordinates of vertices M _{i} and angles α_{i} (measured in degrees). Write a program which restores co-ordinates of the polygon vertices.Input The first line of an input contains an integer n. The next n lines contain pairs of real numbers which are co-ordinates of points M _{i}. And the last n lines of the file consist of degree values of angles α_{i}. Output The output file should contain n lines of pairs of coordinates of the points Sample Input 3 0 2 3 3 2 0 90 90 90 Sample Output Hint 1 1
1 3 3 1 Source |

[Submit] [Go Back] [Status] [Discuss]

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di

Any problem, Please Contact Administrator