#P11099. [2016杭电多校]Hard problem
[2016杭电多校]Hard problem
Hard problem
Problem Description
cjj is fun with math problem. One day he found a Olympic Mathematics problem for primary school students. It is too difficult for cjj. Can you solve it?
Consider the square . Let be its inscribed disk, with center and radius . Draw quarter disks of radius inside the square, centered at the two opposite vertices and .
The shaded area consists of points in that lie outside at least one of the two quarter disks. Given , compute the total shaded area.

Input
The first line contains a integer T(1<=T<=10000), means the number of the test case. Each case contains one line with integer l(1<=l<=10000).
Output
For each test case, print the shaded area on its own line, rounded to exactly two digits after the decimal point.
Sample Input
1
1
Sample Output
0.29
Author
BUPT
Source
2016 Multi-University Training Contest 10