hdu-1071-The area-简单积分

原创 2016年05月30日 20:20:56

Link: http://acm.hdu.edu.cn/showproblem.php?pid=1071

The area

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 9613    Accepted Submission(s): 6761

Problem Description

  Ignatius bought a land last week, but he didn't know the area of the land because the land is enclosed by a parabola and a straight line. The picture below shows the area. Now given all the intersectant points shows in the picture, can you tell Ignatius the area of the land?

  Note: The point P1 in the picture is the vertex of the parabola.

这里写图片描述

Input

  The input contains several test cases. The first line of the input is a single integer T which is the number of test cases. T test cases follow.
  Each test case contains three intersectant points which shows in the picture, they are given in the order of P1, P2, P3. Each point is described by two floating-point numbers X and Y(0.0<=X,Y<=1000.0).

Output

  For each test case, you should output the area of the land, the result should be rounded to 2 decimal places.

Sample Input

2
5.000000 5.000000
0.000000 0.000000
10.000000 0.000000
10.000000 10.000000
1.000000 1.000000
14.000000 8.222222

Sample Output

33.33
40.69

Hint

For float may be not accurate enough, please use double instead of float.

Author
Ignatius.L

Recommend

We have carefully selected several similar problems for you:  1008 1021 1108 1019 1049 

过程
这里写图片描述

代码

#include <cstdio>
using namespace std;
double x1,x2,x3,y1,y2,y3;
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%lf%lf%lf%lf%lf%lf",&x1,&y1,&x2,&y2,&x3,&y3);
        long double a=(long double)(y2-y1)/((x1-x2)*(x1-x2));
        long double ans=(x3*x3*x3-x2*x2*x2)*a*2-3*a*(x3+x2)*(x3*x3-x2*x2)+y1*(x3-x2)*6+a*6*(x1*x1)*(x3-x2)+6*(x2*y3-y2*x3);
        ans/=6;
        printf("%.2f\n",(double)ans);
    }
    return 0;
}
版权声明:本文为博主原创文章,未经博主允许不得转载。 举报

相关文章推荐

hdu-1071-The area-简单积分

hdu-1071-The area-简单积分

hdu 1071 The area

The area Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total...

精选:深入理解 Docker 内部原理及网络配置

网络绝对是任何系统的核心,对于容器而言也是如此。Docker 作为目前最火的轻量级容器技术,有很多令人称道的功能,如 Docker 的镜像管理。然而,Docker的网络一直以来都比较薄弱,所以我们有必要深入了解Docker的网络知识,以满足更高的网络需求。

HDU 1071 The area (定积分求面积)

The area Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total S...

HDU 1071 The area

The area Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total...

HDU 1071 The area

import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner...

hdu 1071 The area

The area Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total...

HDU 1071 The area

积分

The area (HDU 1071)

Problem - 1071 Online Judge Online Exercise Online Teaching Online ...

HDU 1071 The area

#include #include int main() { double x1,x2,x3,y1,y2,y3,a,b,c,s1,s2,k,t; int n; scanf("%...

HDU 1071 The area

The area Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total...
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

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