HDU5858-Hard problem

Hard problem

                                                                      Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
                                                                                                Total Submission(s): 705    Accepted Submission(s): 454

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?


Give you the side length of the square L, you need to calculate the shaded area in the picture.

The full circle is the inscribed circle of the square, and the center of two quarter circle is the vertex of square, and its radius is the length of the square.

 

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 one line, the shade area in the picture. The answer is round to two digit.

 

Sample Input

  
  

   
   1
1
  
  

 

Sample Output

  
  

   
   0.29
  
  

 

Author

BUPT

 

Source

2016 Multi-University Training Contest 10

 

Recommend

wange2014

 

题意：给你图中正方形的边长，求出图中阴影面积的大小

解题思路：添加如下辅助线即可

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <map>
#include <cmath>
#include <set>
#include <stack>
#include <queue>
#include <vector>
#include <bitset>
#include <functional>

using namespace std;

#define LL long long
const int INF = 0x3f3f3f3f;
const double pi = acos(-1.0);

int main()
{
	int t;
	double l;
	scanf("%d", &t);
	while (t--)
	{
		scanf("%lf", &l);
		double x1 = acos(5 * l*l / 4 / (sqrt(2)*l*l));
		double x2 = acos(-l*l / 4 / (sqrt(2) / 2 * l*l));
		double sum1 = l*l / 8 * (2 * pi - x2 * 2);
		double sum2 = l*l*x1 - l*l / sqrt(2)*sin(x1);
		printf("%.2lf\n", 2 * (sum1 - sum2));
	}
	return 0;
}