As a Triangle Country Optimizer (TCO in short), you need to build some triangular power-net to avert your empire being attacked. There are n beacons in the country and each time you may use any three of them as the corners to build triangular power-nets. However, you recalled that any two power-nets should never intersect with positive area, since doubly protected area meant unfairness. You must gain all the ascendancy to get the maximum area being covered that you can achieve.
First line contains an intger T(1<=T<=500) indicating the number of test cases.
For each following test case, first line contains an integer n(3<=n<=100) representing the number of beacons in the territory. Each of the next n lines contains two integers xi, yi (-514<=xi, yi<=514).
For each test case, please output the area.
1 3 0 0 10 0 0 10
50.000000
Info: 本題輸出為浮點數,絕對或相對誤差 1e-6 以下視為正確
Migrated from old NTUJ.
Shik and Tmt
No. | Testdata Range | Score |
---|