HDU 5858 Hard problem(计算几何)
来源:互联网 发布:最好的网络借贷平台 编辑:程序博客网 时间:2024/05/20 13:17
Hard problem
Time Limit: 2000/1000 MS (Java/Others)
Memory Limit: 65536/65536 K (Java/Others)
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.
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
题意:
求变成为length的正方形中阴影部分的面积;
思路:
建坐标系积分就好了;以参考资料中的D点为原点,然后得到两个圆的方程,联立求交点得到积分区间,然后积分,积分的时候借用三角函数; http://zhidao.baidu.com/question/571519797
另一种解法也可以用以正方形的中心为原点,以对角线为水平轴,然后得到两个圆的方程,联立求交点得到积分区间,然后积分。
#include <iostream>#include <cstdio>#include <cstring>#include <cmath>#include <algorithm>#include <queue>#include <map>#include <set>#include <stack>#include <vector>#include <list>#define LL long long#define eps 1e-8#define maxn 110#define mod 100000007#define inf 0x3f3f3f3f#define mid(a,b) ((a+b)>>1)#define IN freopen("in.txt","r",stdin);using namespace std;int main(int argc, char const *argv[]){ //IN; int t; cin >> t; while(t--) { double a; scanf("%lf", &a); //double ans = a*a/4.0 * asin(sqrt(14.0)/4.0); //ans -= a*a * asin(sqrt(14.0)/8.0); //ans += a*a * sqrt(7.0) / 8.0; //ans *= 2.0; double ans = atan(sqrt(7.0)) / 4.0; ans -= atan(sqrt(7.0)/5.0); ans += sqrt(7.0) / 8.0; ans *= a*a*2.0; printf("%.2f\n", ans); } return 0;}
0 0
- HDU 5858 Hard problem(计算几何)
- HDU 5858 Hard problem(计算几何)
- HDU-5858 Hard problem(计算几何)
- hdu 5858 Hard problem【计算几何+思维】
- HDU-5858 Hard problem(数学公式、计算几何)
- HDU 5858 Hard problem——计算几何(微积分)
- HDU 5858 Hard problem (几何)
- HDU-5858-Hard problem(几何)
- HDU 5858 Hard problem(几何)
- HDU 5858 Hard problem(计算几何)【较难】【多校联合8.18】
- hdu5858 Hard problem (计算几何)
- 【HDU5828】Hard problem(计算几何)
- HDU 6127 Hard challenge(计算几何)
- HDU 5858 Hard problem 2016多校10 1002 [相交圆面积]【计算几何】
- hdu 5858 Hard problem
- hdu 5858 Hard problem
- HDU 5858 Hard Problem
- hdu 5858 Hard problem
- PyQt实现的生产者消费者模型
- 颜色空间那些事儿
- [Leetcode] Majority Element
- dfs-poj-1321棋盘问题
- 【洛谷P1268】树的重量 具体问题具体分析
- HDU 5858 Hard problem(计算几何)
- springMVC框架开发笔记 lesson3 SSM框架整合
- HTTP状态码
- [Leetcode] Contains Duplicate
- 判断两个树是否互相镜像
- python(七)下:初识socket网络编程
- 【light-oj】-1006 - Hex-a-bonacci(思维)
- mac 下如何切换jdk 版本,以及动态切换
- [Leetcode] Intersection of Two Arrays II