hdu 1724 Ellipse(simpson求积分)

原创 2013年12月03日 23:55:19

Ellipse

Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1013    Accepted Submission(s): 363


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
 

Sample Output
6.283 3.142
 

Author
威士忌
 

Source

题目:求阴影面积

题解:simpson求积分,下面是公式,一般用第一条,注意精度就行了


#include<stdio.h>
#include<math.h>
#define EPS 1e-6
double a,b;
double f(double x)
{
    return b*sqrt(1.0-x*x/(a*a));
}
double simpson(double l,double r)
{
    double mid=l+(r-l)/2.0;
    return (r-l)*(f(l)+4.0*f(mid)+f(r))/6.0;
}
double solve(double l,double r,double eps)
{
    double mid=l+(r-l)/2.0;
    if(fabs(simpson(l,r)-simpson(l,mid)-simpson(mid,r))<eps) return simpson(l,r);
    else return solve(l,mid,eps/2)+solve(mid,r,eps/2);
}
int main()
{
    int t;
    double l,r;

    //freopen("t.txt","r",stdin);
    scanf("%d",&t);
    while(t--)
    {
        scanf("%lf%lf%lf%lf",&a,&b,&l,&r);
        printf("%.3lf\n",2*solve(l,r,EPS));
    }

    return 0;
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

HDU1724 - 积分

Ellipse Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total ...

【HDU 1724】Ellipse

simpson积分模板题~

Hdu 1724 Ellipse (自适应辛普森积分法)

辛普森积分公式:http://zh.wikipedia.org/zh-tw/%E8%BE%9B%E6%99%AE%E6%A3%AE%E7%A9%8D%E5%88%86%E6%B3%95 代码参考

HDU1724-辛普森积分公式法求椭圆面积

Ellipse Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Su...

hdu 1724 Ellipse(Simpson积分法)

Ellipse Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total ...

HDU 1724 Ellipse 【自适应Simpson积分】

Ellipse Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) To...

hdoj-1724 Ellipse(自适应Simpson积分)

浙大月赛的时候卡在了一道积分题目上,被积函数无法求出原函数。 连接:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3898 ...

HDU 1724 Ellipse 自适应simpson函数模板题(二)

Ellipse Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total ...

HDU 1724 Ellipse

simpson积分

Hdu 4498 Function Curve(Simpson积分)

题目地址:http://acm.hdu.edu.cn/showproblem.php?pid=4498 思路:分段积分。求出每个函数与y=100和每两个函数图像的交点,排序后枚举每段取最小值,分段积分...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)