hdu-1742Ellipse(自适应辛普森)
来源:互联网 发布:管理加载项java不可用 编辑:程序博客网 时间:2024/06/10 18:08
Ellipse
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2418 Accepted Submission(s): 1076
Problem Description
Math is important!! Many students failed in 2+2’s mathematical test, so let's AC this problem to mourn for our lost youth..
Look this sample picture:
A ellipses in the plane and center in point O. the L,R lines will be vertical through the X-axis. The problem is calculating the blue intersection area. But calculating the intersection area is dull, so I have turn to you, a talent of programmer. Your task is tell me the result of calculations.(defined PI=3.14159265 , The area of an ellipse A=PI*a*b )
Input
Input may contain multiple test cases. The first line is a positive integer N, denoting the number of test cases below. One case One line. The line will consist of a pair of integers a and b, denoting the ellipse equation , A pair of integers l and r, mean the L is (l, 0) and R is (r, 0). (-a <= l <= r <= a).
Output
For each case, output one line containing a float, the area of the intersection, accurate to three decimals after the decimal point.
Sample Input
2
2 1 -2 2
2 1 0 2
6.283
3.142
#include<map>#include<queue>#include<math.h>#include<vector>#include<string>#include<stdio.h>#include<iostream>#include<string.h>#include<algorithm>#define inf 0x3f3f3f#define ll long long#define maxn 100005using namespace std;double a1,b1;double F(double x) //这里自定义函数{ return b1 * sqrt(1.0 - (x * x) / (a1 * a1));}double simpson(double a,double b) //返回区间[a,b]的三点辛普森值{ double c = a + (b - a) / 2.0; return (F(a) + 4 * F(c) + F(b)) * (b - a) / 6.0;}double asr(double a,double b,double eps,double A) //自适应辛普森递归过程{ double c = a + (b - a) / 2.0; //A为区间[a,b]的三点辛普森值 double L = simpson(a,c), R = simpson(c,b); if(fabs(L + R - A) <= 15 * eps) return L + R + (L + R - A) / 15.0; return asr(a,c,eps/2.0,L) + asr(c,b,eps/2.0,R);}double asr(double a,double b,double eps) //自适应辛普森主过程{ return asr(a,b,eps,simpson(a,b));}int main(){ int t; scanf("%d",&t); while(t--) { double l,r; double eps=1e-5; cin>>a1>>b1>>l>>r; double ans=asr(l,r,eps); ans*=2.0; printf("%.3lf\n",ans); }}
阅读全文
0 0
- hdu-1742Ellipse(自适应辛普森)
- Hdu 1724 Ellipse (自适应辛普森积分法)
- HDU 1724 Ellipse (自适应辛普森公式)
- HDU 1724 Ellipse 自适应辛普森积分
- HDU 1724 Ellipse (自适应辛普森积分)
- HDU 1724 Ellipse (自适应辛普森积分模板题)
- hdu 1742 Ellipse
- HDU 1724 Ellipse 【自适应Simpson积分】
- hdu 1724 Ellipse(自适应Simpson积分) (模板)
- 【自适应Simpson积分】hdu 1724 Ellipse
- HDU-#1724 Ellipse(自适应Simpson法+数值积分)
- HDU 1724 Ellipse 自适应simpson函数模板题(二)
- hdu 1724 Ellipse (自适应辛普森求积分 模板题)
- [自适应Simpson]Ellipse
- HDOJ 1724 Ellipse 自适应Simpson
- 【HDU 1724】Ellipse
- HDU 1724 Ellipse
- hdoj-1724 Ellipse(自适应Simpson积分)
- 常用的端口
- 先验概率、似然函数与后验概率
- 二分图匹配
- android即时通讯,融云使用学习
- 第三方高德地图
- hdu-1742Ellipse(自适应辛普森)
- 程序是怎么跑起来的?---(1)热身
- leetcode 476. Number Complement 求补数
- 2.3 连续信源
- (二)java框架篇笔记库(23)
- Conscription (最小生成树)
- 一个设想:基于colinux,去厚重虚拟化,共盘直接文件系统安装运行的windows,linux
- android第三方地图使用-百度地图
- JRiver Media Center 23(多媒体播放工具)官方正式版64位V23.0.84下载 | jriver media center 破解版