当前你的浏览器版本过低，网站已在兼容模式下运行，兼容模式仅提供最小功能支持，网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。
LL bought a big cake on his birthday, which was circle looked from above. HH found it and cut the cake into pieces secretly using a big knife. Each cut was a straight line through the cake. Since HH cut it irregularly, the cake was cut into a mess. Of course at last LL found it and got angry, so he decided to discuss with HH.
LL :"I planed to share it with you at the beginning, but now you can only eat one piece."
HH :"OK... I will choose the largest piece..."
Please help HH to choose the largest one.
The first line of input contains one integer specifying the number of test cases to follow. Each test case begins with a line containing one integer N (1 ≤ N ≤ 100), the number of cut HH performed.
Following N lines each contains two numbers describe the ith cut as following:
Suppose the origin is at the center of the cake. Each cut intersects the cake at two points. The polar angles of the two intersections are the given two numbers. They are in range [-π, π).
Note: No three cut intersects at one point. Any two cut are distinct. The cake has radius 10.0.
3 2 -3.140000 0.000000 -1.000000 1.000000 2 -3.141592 0.000000 -1.570796 1.570796 3 -3.000000 3.000000 -2.000000 2.000000 -1.000000 1.000000
129.96 78.54 183.30
| 时间上限 | 内存上限 |
| 1000 | 65536 |